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_out3.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:13:56,204 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:13:56,206 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:13:56,221 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:13:56,221 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:13:56,222 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:13:56,223 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:13:56,225 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:13:56,227 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:13:56,228 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:13:56,229 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:13:56,229 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:13:56,230 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:13:56,231 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:13:56,234 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:13:56,236 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:13:56,236 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:13:56,242 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:13:56,245 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:13:56,251 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:13:56,252 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:13:56,253 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:13:56,258 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:13:56,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:13:56,258 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:13:56,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:13:56,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:13:56,261 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:13:56,262 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:13:56,263 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:13:56,263 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:13:56,263 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:13:56,264 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:13:56,264 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:13:56,265 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:13:56,265 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:13:56,266 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-10-04 12:13:56,288 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:13:56,288 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:13:56,289 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:13:56,289 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:13:56,290 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:13:56,290 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:13:56,291 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:13:56,291 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:13:56,291 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:13:56,291 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:13:56,291 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:13:56,292 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:13:56,292 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:13:56,292 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:13:56,292 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:13:56,292 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:13:56,292 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:13:56,293 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:13:56,294 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:13:56,294 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:13:56,294 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:13:56,295 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:13:56,295 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:13:56,295 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:13:56,295 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:13:56,295 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:13:56,296 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:13:56,296 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:13:56,296 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:13:56,296 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:13:56,371 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:13:56,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:13:56,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:13:56,394 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:13:56,396 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:13:56,397 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl [2018-10-04 12:13:56,397 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-10-04 12:13:56,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:13:56,482 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:13:56,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:13:56,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:13:56,484 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:13:56,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:56" (1/1) ... [2018-10-04 12:13:56,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:56" (1/1) ... [2018-10-04 12:13:56,540 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:13:56,541 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:13:56,541 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:13:56,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:13:56,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:13:56,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:13:56,550 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:13:56,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:56" (1/1) ... [2018-10-04 12:13:56,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:56" (1/1) ... [2018-10-04 12:13:56,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:56" (1/1) ... [2018-10-04 12:13:56,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:56" (1/1) ... [2018-10-04 12:13:56,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:56" (1/1) ... [2018-10-04 12:13:56,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:56" (1/1) ... [2018-10-04 12:13:56,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:56" (1/1) ... [2018-10-04 12:13:56,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:13:56,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:13:56,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:13:56,604 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:13:56,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:13:56,680 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-04 12:13:56,680 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-04 12:13:56,681 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-04 12:13:57,778 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:13:57,779 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:13:57 BoogieIcfgContainer [2018-10-04 12:13:57,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:13:57,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:13:57,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:13:57,784 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:13:57,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:56" (1/2) ... [2018-10-04 12:13:57,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42dfb590 and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:13:57, skipping insertion in model container [2018-10-04 12:13:57,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:13:57" (2/2) ... [2018-10-04 12:13:57,787 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-10-04 12:13:57,797 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:13:57,806 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-10-04 12:13:57,857 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:13:57,858 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:13:57,858 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:13:57,858 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:13:57,858 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:13:57,859 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:13:57,859 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:13:57,859 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:13:57,859 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:13:57,879 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-10-04 12:13:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:13:57,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:57,887 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:13:57,889 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:13:57,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:57,895 INFO L82 PathProgramCache]: Analyzing trace with hash 45506320, now seen corresponding path program 1 times [2018-10-04 12:13:57,898 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:57,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:57,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:57,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:57,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:58,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:58,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:58,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:13:58,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:13:58,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:13:58,355 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 5 states. [2018-10-04 12:14:00,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:00,126 INFO L93 Difference]: Finished difference Result 142 states and 303 transitions. [2018-10-04 12:14:00,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:14:00,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:14:00,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:00,147 INFO L225 Difference]: With dead ends: 142 [2018-10-04 12:14:00,148 INFO L226 Difference]: Without dead ends: 138 [2018-10-04 12:14:00,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:00,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-04 12:14:00,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2018-10-04 12:14:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-04 12:14:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 219 transitions. [2018-10-04 12:14:00,210 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 219 transitions. Word has length 5 [2018-10-04 12:14:00,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:00,212 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 219 transitions. [2018-10-04 12:14:00,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:14:00,213 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 219 transitions. [2018-10-04 12:14:00,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:14:00,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:00,214 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:14:00,215 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:00,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:00,216 INFO L82 PathProgramCache]: Analyzing trace with hash 45756290, now seen corresponding path program 1 times [2018-10-04 12:14:00,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:00,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:00,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:00,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:00,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:00,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:00,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:14:00,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:14:00,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:14:00,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:14:00,396 INFO L87 Difference]: Start difference. First operand 98 states and 219 transitions. Second operand 5 states. [2018-10-04 12:14:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:01,973 INFO L93 Difference]: Finished difference Result 241 states and 539 transitions. [2018-10-04 12:14:01,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:14:01,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:14:01,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:01,978 INFO L225 Difference]: With dead ends: 241 [2018-10-04 12:14:01,979 INFO L226 Difference]: Without dead ends: 237 [2018-10-04 12:14:01,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:01,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-04 12:14:02,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 134. [2018-10-04 12:14:02,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-04 12:14:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2018-10-04 12:14:02,036 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 5 [2018-10-04 12:14:02,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:02,036 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2018-10-04 12:14:02,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:14:02,037 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2018-10-04 12:14:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:14:02,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:02,038 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:14:02,039 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:02,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:02,039 INFO L82 PathProgramCache]: Analyzing trace with hash 28948051, now seen corresponding path program 1 times [2018-10-04 12:14:02,040 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:02,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:02,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:02,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:02,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:02,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:02,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:14:02,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:14:02,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:14:02,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:14:02,177 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 5 states. [2018-10-04 12:14:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:03,292 INFO L93 Difference]: Finished difference Result 269 states and 639 transitions. [2018-10-04 12:14:03,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:14:03,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:14:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:03,296 INFO L225 Difference]: With dead ends: 269 [2018-10-04 12:14:03,297 INFO L226 Difference]: Without dead ends: 265 [2018-10-04 12:14:03,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-04 12:14:03,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 162. [2018-10-04 12:14:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-04 12:14:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 455 transitions. [2018-10-04 12:14:03,329 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 455 transitions. Word has length 5 [2018-10-04 12:14:03,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:03,329 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 455 transitions. [2018-10-04 12:14:03,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:14:03,330 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 455 transitions. [2018-10-04 12:14:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:03,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:03,331 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:03,333 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:03,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:03,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558066, now seen corresponding path program 1 times [2018-10-04 12:14:03,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:03,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:03,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:03,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:03,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:03,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:03,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:03,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:14:03,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:03,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:03,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:03,470 INFO L87 Difference]: Start difference. First operand 162 states and 455 transitions. Second operand 8 states. [2018-10-04 12:14:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:08,540 INFO L93 Difference]: Finished difference Result 790 states and 2085 transitions. [2018-10-04 12:14:08,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:14:08,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:14:08,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:08,548 INFO L225 Difference]: With dead ends: 790 [2018-10-04 12:14:08,548 INFO L226 Difference]: Without dead ends: 629 [2018-10-04 12:14:08,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:14:08,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-04 12:14:08,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 278. [2018-10-04 12:14:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-04 12:14:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 854 transitions. [2018-10-04 12:14:08,601 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 854 transitions. Word has length 8 [2018-10-04 12:14:08,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:08,601 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 854 transitions. [2018-10-04 12:14:08,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:08,601 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 854 transitions. [2018-10-04 12:14:08,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:08,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:08,603 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:08,604 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:08,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:08,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558063, now seen corresponding path program 1 times [2018-10-04 12:14:08,605 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:08,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:08,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:08,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:08,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:08,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:08,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:14:08,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:08,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:08,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:08,861 INFO L87 Difference]: Start difference. First operand 278 states and 854 transitions. Second operand 8 states. [2018-10-04 12:14:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:11,977 INFO L93 Difference]: Finished difference Result 634 states and 1540 transitions. [2018-10-04 12:14:11,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:14:11,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:14:11,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:11,985 INFO L225 Difference]: With dead ends: 634 [2018-10-04 12:14:11,985 INFO L226 Difference]: Without dead ends: 628 [2018-10-04 12:14:11,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:14:11,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-10-04 12:14:12,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 310. [2018-10-04 12:14:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-04 12:14:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 963 transitions. [2018-10-04 12:14:12,051 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 963 transitions. Word has length 8 [2018-10-04 12:14:12,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:12,051 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 963 transitions. [2018-10-04 12:14:12,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:12,051 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 963 transitions. [2018-10-04 12:14:12,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:12,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:12,053 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:12,054 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:12,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:12,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1080099218, now seen corresponding path program 1 times [2018-10-04 12:14:12,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:12,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:12,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:12,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:12,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:12,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:12,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:14:12,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:12,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:12,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:12,199 INFO L87 Difference]: Start difference. First operand 310 states and 963 transitions. Second operand 8 states. [2018-10-04 12:14:13,732 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:14:14,220 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-04 12:14:16,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:16,362 INFO L93 Difference]: Finished difference Result 768 states and 2087 transitions. [2018-10-04 12:14:16,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:14:16,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:14:16,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:16,370 INFO L225 Difference]: With dead ends: 768 [2018-10-04 12:14:16,370 INFO L226 Difference]: Without dead ends: 537 [2018-10-04 12:14:16,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:14:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-10-04 12:14:16,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 334. [2018-10-04 12:14:16,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-04 12:14:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1037 transitions. [2018-10-04 12:14:16,426 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1037 transitions. Word has length 8 [2018-10-04 12:14:16,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:16,427 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1037 transitions. [2018-10-04 12:14:16,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:16,427 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1037 transitions. [2018-10-04 12:14:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:16,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:16,429 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:16,429 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:16,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:16,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595081, now seen corresponding path program 1 times [2018-10-04 12:14:16,430 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:16,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:16,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:16,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:16,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:16,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:16,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:16,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:14:16,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:16,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:16,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:16,578 INFO L87 Difference]: Start difference. First operand 334 states and 1037 transitions. Second operand 8 states. [2018-10-04 12:14:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:19,152 INFO L93 Difference]: Finished difference Result 1145 states and 3146 transitions. [2018-10-04 12:14:19,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:14:19,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:14:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:19,159 INFO L225 Difference]: With dead ends: 1145 [2018-10-04 12:14:19,159 INFO L226 Difference]: Without dead ends: 812 [2018-10-04 12:14:19,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:14:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-10-04 12:14:19,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 450. [2018-10-04 12:14:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-10-04 12:14:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1432 transitions. [2018-10-04 12:14:19,228 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1432 transitions. Word has length 8 [2018-10-04 12:14:19,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:19,229 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1432 transitions. [2018-10-04 12:14:19,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:19,229 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1432 transitions. [2018-10-04 12:14:19,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:19,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:19,230 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:19,231 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:19,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:19,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595078, now seen corresponding path program 1 times [2018-10-04 12:14:19,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:19,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:19,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:19,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:19,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:19,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:19,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:14:19,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:19,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:19,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:19,327 INFO L87 Difference]: Start difference. First operand 450 states and 1432 transitions. Second operand 8 states. [2018-10-04 12:14:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:21,608 INFO L93 Difference]: Finished difference Result 877 states and 2260 transitions. [2018-10-04 12:14:21,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:14:21,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:14:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:21,614 INFO L225 Difference]: With dead ends: 877 [2018-10-04 12:14:21,614 INFO L226 Difference]: Without dead ends: 871 [2018-10-04 12:14:21,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:14:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-10-04 12:14:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 478. [2018-10-04 12:14:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-10-04 12:14:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1531 transitions. [2018-10-04 12:14:21,705 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1531 transitions. Word has length 8 [2018-10-04 12:14:21,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:21,705 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 1531 transitions. [2018-10-04 12:14:21,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1531 transitions. [2018-10-04 12:14:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:21,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:21,706 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:21,707 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:21,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:21,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064444, now seen corresponding path program 1 times [2018-10-04 12:14:21,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:21,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:21,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:21,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:21,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:21,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:21,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:21,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:14:21,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:21,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:21,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:21,912 INFO L87 Difference]: Start difference. First operand 478 states and 1531 transitions. Second operand 8 states. [2018-10-04 12:14:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:23,879 INFO L93 Difference]: Finished difference Result 1049 states and 2854 transitions. [2018-10-04 12:14:23,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:14:23,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:14:23,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:23,884 INFO L225 Difference]: With dead ends: 1049 [2018-10-04 12:14:23,885 INFO L226 Difference]: Without dead ends: 818 [2018-10-04 12:14:23,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:14:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-10-04 12:14:23,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 524. [2018-10-04 12:14:23,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-04 12:14:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1684 transitions. [2018-10-04 12:14:23,985 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1684 transitions. Word has length 8 [2018-10-04 12:14:23,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:23,985 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 1684 transitions. [2018-10-04 12:14:23,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:23,985 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1684 transitions. [2018-10-04 12:14:23,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:23,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:23,987 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:23,987 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:23,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:23,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064441, now seen corresponding path program 1 times [2018-10-04 12:14:23,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:23,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:23,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:24,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-10-04 12:14:24,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:24,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:14:24,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:24,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:24,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:24,101 INFO L87 Difference]: Start difference. First operand 524 states and 1684 transitions. Second operand 8 states. [2018-10-04 12:14:25,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:25,805 INFO L93 Difference]: Finished difference Result 733 states and 1997 transitions. [2018-10-04 12:14:25,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:14:25,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:14:25,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:25,811 INFO L225 Difference]: With dead ends: 733 [2018-10-04 12:14:25,812 INFO L226 Difference]: Without dead ends: 727 [2018-10-04 12:14:25,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:14:25,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-10-04 12:14:25,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 530. [2018-10-04 12:14:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-10-04 12:14:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1690 transitions. [2018-10-04 12:14:25,925 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1690 transitions. Word has length 8 [2018-10-04 12:14:25,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:25,925 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1690 transitions. [2018-10-04 12:14:25,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:25,926 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1690 transitions. [2018-10-04 12:14:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:25,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:25,927 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:25,928 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:25,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656691, now seen corresponding path program 1 times [2018-10-04 12:14:25,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:25,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:25,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:25,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:25,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:26,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-10-04 12:14:26,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:26,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:14:26,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:26,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:26,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:26,052 INFO L87 Difference]: Start difference. First operand 530 states and 1690 transitions. Second operand 8 states. [2018-10-04 12:14:29,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:29,075 INFO L93 Difference]: Finished difference Result 1329 states and 3609 transitions. [2018-10-04 12:14:29,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 12:14:29,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:14:29,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:29,084 INFO L225 Difference]: With dead ends: 1329 [2018-10-04 12:14:29,084 INFO L226 Difference]: Without dead ends: 1323 [2018-10-04 12:14:29,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:14:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-10-04 12:14:29,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 626. [2018-10-04 12:14:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-10-04 12:14:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 2087 transitions. [2018-10-04 12:14:29,267 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 2087 transitions. Word has length 8 [2018-10-04 12:14:29,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:29,267 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 2087 transitions. [2018-10-04 12:14:29,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:29,267 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 2087 transitions. [2018-10-04 12:14:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:29,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:29,268 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:29,269 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:29,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:29,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656688, now seen corresponding path program 1 times [2018-10-04 12:14:29,270 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:29,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:29,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:29,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:29,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:29,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:29,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:29,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:14:29,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:29,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:29,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:29,757 INFO L87 Difference]: Start difference. First operand 626 states and 2087 transitions. Second operand 8 states. [2018-10-04 12:14:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:32,232 INFO L93 Difference]: Finished difference Result 1268 states and 3539 transitions. [2018-10-04 12:14:32,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:14:32,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:14:32,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:32,239 INFO L225 Difference]: With dead ends: 1268 [2018-10-04 12:14:32,239 INFO L226 Difference]: Without dead ends: 1262 [2018-10-04 12:14:32,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:14:32,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-10-04 12:14:32,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 618. [2018-10-04 12:14:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-04 12:14:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2056 transitions. [2018-10-04 12:14:32,416 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2056 transitions. Word has length 8 [2018-10-04 12:14:32,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:32,417 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 2056 transitions. [2018-10-04 12:14:32,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2056 transitions. [2018-10-04 12:14:32,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:32,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:32,418 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:32,419 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:32,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:32,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285639, now seen corresponding path program 1 times [2018-10-04 12:14:32,419 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:32,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:32,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:32,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:32,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:32,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:32,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:14:32,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:32,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:32,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:32,548 INFO L87 Difference]: Start difference. First operand 618 states and 2056 transitions. Second operand 8 states. [2018-10-04 12:14:34,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:34,958 INFO L93 Difference]: Finished difference Result 1367 states and 3876 transitions. [2018-10-04 12:14:34,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:14:34,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:14:34,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:34,966 INFO L225 Difference]: With dead ends: 1367 [2018-10-04 12:14:34,966 INFO L226 Difference]: Without dead ends: 1361 [2018-10-04 12:14:34,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:14:34,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-10-04 12:14:35,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 671. [2018-10-04 12:14:35,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-10-04 12:14:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2249 transitions. [2018-10-04 12:14:35,144 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2249 transitions. Word has length 8 [2018-10-04 12:14:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:35,144 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 2249 transitions. [2018-10-04 12:14:35,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2249 transitions. [2018-10-04 12:14:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:35,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:35,146 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:35,146 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:35,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:35,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285636, now seen corresponding path program 1 times [2018-10-04 12:14:35,147 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:35,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:35,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:35,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:35,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:35,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:35,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:14:35,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:35,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:35,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:35,267 INFO L87 Difference]: Start difference. First operand 671 states and 2249 transitions. Second operand 8 states. [2018-10-04 12:14:38,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:38,521 INFO L93 Difference]: Finished difference Result 1373 states and 3787 transitions. [2018-10-04 12:14:38,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:14:38,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:14:38,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:38,532 INFO L225 Difference]: With dead ends: 1373 [2018-10-04 12:14:38,532 INFO L226 Difference]: Without dead ends: 1367 [2018-10-04 12:14:38,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2018-10-04 12:14:38,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-10-04 12:14:38,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 698. [2018-10-04 12:14:38,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-10-04 12:14:38,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2344 transitions. [2018-10-04 12:14:38,740 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2344 transitions. Word has length 8 [2018-10-04 12:14:38,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:38,741 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 2344 transitions. [2018-10-04 12:14:38,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:38,741 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2344 transitions. [2018-10-04 12:14:38,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:38,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:38,742 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:38,743 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:38,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:38,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280348, now seen corresponding path program 1 times [2018-10-04 12:14:38,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:38,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:38,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:38,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:38,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:38,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:38,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:14:38,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:38,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:38,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:38,857 INFO L87 Difference]: Start difference. First operand 698 states and 2344 transitions. Second operand 7 states. [2018-10-04 12:14:41,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:41,069 INFO L93 Difference]: Finished difference Result 1526 states and 4298 transitions. [2018-10-04 12:14:41,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:14:41,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:14:41,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:41,077 INFO L225 Difference]: With dead ends: 1526 [2018-10-04 12:14:41,077 INFO L226 Difference]: Without dead ends: 1520 [2018-10-04 12:14:41,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:14:41,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-10-04 12:14:41,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 789. [2018-10-04 12:14:41,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-10-04 12:14:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2673 transitions. [2018-10-04 12:14:41,296 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2673 transitions. Word has length 8 [2018-10-04 12:14:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:41,297 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 2673 transitions. [2018-10-04 12:14:41,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2673 transitions. [2018-10-04 12:14:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:41,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:41,299 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:41,299 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:41,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:41,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280221, now seen corresponding path program 1 times [2018-10-04 12:14:41,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:41,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:41,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:41,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:41,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:41,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:41,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:14:41,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:41,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:41,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:41,452 INFO L87 Difference]: Start difference. First operand 789 states and 2673 transitions. Second operand 7 states. [2018-10-04 12:14:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:43,613 INFO L93 Difference]: Finished difference Result 1548 states and 4356 transitions. [2018-10-04 12:14:43,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:14:43,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:14:43,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:43,621 INFO L225 Difference]: With dead ends: 1548 [2018-10-04 12:14:43,621 INFO L226 Difference]: Without dead ends: 1542 [2018-10-04 12:14:43,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:14:43,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-10-04 12:14:43,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 821. [2018-10-04 12:14:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-04 12:14:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2801 transitions. [2018-10-04 12:14:43,849 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2801 transitions. Word has length 8 [2018-10-04 12:14:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:43,849 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 2801 transitions. [2018-10-04 12:14:43,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2801 transitions. [2018-10-04 12:14:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:43,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:43,851 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:43,851 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:43,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:43,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878937, now seen corresponding path program 1 times [2018-10-04 12:14:43,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:43,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:43,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:43,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:43,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:43,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:43,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:14:43,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:43,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:43,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:43,973 INFO L87 Difference]: Start difference. First operand 821 states and 2801 transitions. Second operand 7 states. [2018-10-04 12:14:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:46,305 INFO L93 Difference]: Finished difference Result 1575 states and 4539 transitions. [2018-10-04 12:14:46,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:14:46,306 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:14:46,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:46,314 INFO L225 Difference]: With dead ends: 1575 [2018-10-04 12:14:46,314 INFO L226 Difference]: Without dead ends: 1569 [2018-10-04 12:14:46,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:14:46,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-10-04 12:14:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 849. [2018-10-04 12:14:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-10-04 12:14:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2913 transitions. [2018-10-04 12:14:46,624 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2913 transitions. Word has length 8 [2018-10-04 12:14:46,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:46,624 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 2913 transitions. [2018-10-04 12:14:46,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:46,624 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2913 transitions. [2018-10-04 12:14:46,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:46,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:46,625 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:46,626 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:46,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:46,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878810, now seen corresponding path program 1 times [2018-10-04 12:14:46,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:46,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:46,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:46,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:46,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:46,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:46,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:14:46,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:46,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:46,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:46,730 INFO L87 Difference]: Start difference. First operand 849 states and 2913 transitions. Second operand 7 states. [2018-10-04 12:14:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:48,800 INFO L93 Difference]: Finished difference Result 1597 states and 4579 transitions. [2018-10-04 12:14:48,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:14:48,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:14:48,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:48,811 INFO L225 Difference]: With dead ends: 1597 [2018-10-04 12:14:48,811 INFO L226 Difference]: Without dead ends: 1591 [2018-10-04 12:14:48,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:48,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-10-04 12:14:49,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 873. [2018-10-04 12:14:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-10-04 12:14:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2993 transitions. [2018-10-04 12:14:49,077 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2993 transitions. Word has length 8 [2018-10-04 12:14:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:49,077 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 2993 transitions. [2018-10-04 12:14:49,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2993 transitions. [2018-10-04 12:14:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:49,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:49,078 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:49,079 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:49,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:49,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288024, now seen corresponding path program 1 times [2018-10-04 12:14:49,080 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:49,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:49,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:49,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:49,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:49,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:49,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:14:49,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:49,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:49,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:49,265 INFO L87 Difference]: Start difference. First operand 873 states and 2993 transitions. Second operand 7 states. [2018-10-04 12:14:51,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:51,338 INFO L93 Difference]: Finished difference Result 1726 states and 5211 transitions. [2018-10-04 12:14:51,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:14:51,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:14:51,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:51,349 INFO L225 Difference]: With dead ends: 1726 [2018-10-04 12:14:51,349 INFO L226 Difference]: Without dead ends: 1720 [2018-10-04 12:14:51,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2018-10-04 12:14:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1006. [2018-10-04 12:14:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-10-04 12:14:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3474 transitions. [2018-10-04 12:14:51,706 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3474 transitions. Word has length 8 [2018-10-04 12:14:51,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:51,706 INFO L480 AbstractCegarLoop]: Abstraction has 1006 states and 3474 transitions. [2018-10-04 12:14:51,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3474 transitions. [2018-10-04 12:14:51,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:51,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:51,707 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:51,708 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:51,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:51,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288027, now seen corresponding path program 1 times [2018-10-04 12:14:51,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:51,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:51,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:51,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:51,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:52,007 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-10-04 12:14:52,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:52,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:52,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:14:52,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:52,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:52,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:52,070 INFO L87 Difference]: Start difference. First operand 1006 states and 3474 transitions. Second operand 7 states. [2018-10-04 12:14:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:54,474 INFO L93 Difference]: Finished difference Result 1758 states and 5203 transitions. [2018-10-04 12:14:54,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:14:54,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:14:54,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:54,481 INFO L225 Difference]: With dead ends: 1758 [2018-10-04 12:14:54,482 INFO L226 Difference]: Without dead ends: 1752 [2018-10-04 12:14:54,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:14:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-10-04 12:14:54,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1011. [2018-10-04 12:14:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-10-04 12:14:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3493 transitions. [2018-10-04 12:14:54,850 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3493 transitions. Word has length 8 [2018-10-04 12:14:54,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:54,850 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 3493 transitions. [2018-10-04 12:14:54,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:54,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3493 transitions. [2018-10-04 12:14:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:54,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:54,852 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:54,852 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:54,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:54,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746872, now seen corresponding path program 1 times [2018-10-04 12:14:54,853 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:54,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:54,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:54,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:54,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:54,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:54,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:54,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:14:54,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:54,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:54,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:54,933 INFO L87 Difference]: Start difference. First operand 1011 states and 3493 transitions. Second operand 7 states. [2018-10-04 12:14:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:57,870 INFO L93 Difference]: Finished difference Result 1867 states and 5608 transitions. [2018-10-04 12:14:57,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:14:57,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:14:57,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:57,877 INFO L225 Difference]: With dead ends: 1867 [2018-10-04 12:14:57,877 INFO L226 Difference]: Without dead ends: 1861 [2018-10-04 12:14:57,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:14:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2018-10-04 12:14:58,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1119. [2018-10-04 12:14:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-10-04 12:14:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3931 transitions. [2018-10-04 12:14:58,282 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3931 transitions. Word has length 8 [2018-10-04 12:14:58,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:58,282 INFO L480 AbstractCegarLoop]: Abstraction has 1119 states and 3931 transitions. [2018-10-04 12:14:58,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3931 transitions. [2018-10-04 12:14:58,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:14:58,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:58,284 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:58,284 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:58,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:58,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746875, now seen corresponding path program 1 times [2018-10-04 12:14:58,284 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:58,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:58,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:58,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:58,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:58,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:58,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:14:58,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:58,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:58,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:58,403 INFO L87 Difference]: Start difference. First operand 1119 states and 3931 transitions. Second operand 7 states. [2018-10-04 12:15:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:01,355 INFO L93 Difference]: Finished difference Result 1968 states and 5829 transitions. [2018-10-04 12:15:01,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:15:01,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:15:01,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:01,364 INFO L225 Difference]: With dead ends: 1968 [2018-10-04 12:15:01,364 INFO L226 Difference]: Without dead ends: 1962 [2018-10-04 12:15:01,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:15:01,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-10-04 12:15:01,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1111. [2018-10-04 12:15:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-10-04 12:15:01,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3891 transitions. [2018-10-04 12:15:01,951 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3891 transitions. Word has length 8 [2018-10-04 12:15:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:01,951 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 3891 transitions. [2018-10-04 12:15:01,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:15:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3891 transitions. [2018-10-04 12:15:01,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:15:01,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:01,952 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:01,953 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:01,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:01,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1616407055, now seen corresponding path program 1 times [2018-10-04 12:15:01,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:01,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:01,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:01,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:01,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:02,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:15:02,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:15:02,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:15:02,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:15:02,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:15:02,069 INFO L87 Difference]: Start difference. First operand 1111 states and 3891 transitions. Second operand 7 states. [2018-10-04 12:15:04,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:04,770 INFO L93 Difference]: Finished difference Result 2001 states and 6001 transitions. [2018-10-04 12:15:04,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:15:04,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:15:04,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:04,777 INFO L225 Difference]: With dead ends: 2001 [2018-10-04 12:15:04,778 INFO L226 Difference]: Without dead ends: 1995 [2018-10-04 12:15:04,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:15:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-10-04 12:15:05,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1117. [2018-10-04 12:15:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-10-04 12:15:05,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 3909 transitions. [2018-10-04 12:15:05,293 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 3909 transitions. Word has length 8 [2018-10-04 12:15:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:05,293 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 3909 transitions. [2018-10-04 12:15:05,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:15:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 3909 transitions. [2018-10-04 12:15:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:15:05,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:05,294 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:05,295 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:05,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:05,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1616406928, now seen corresponding path program 1 times [2018-10-04 12:15:05,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:05,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:05,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:05,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:05,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:05,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:15:05,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:15:05,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:15:05,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:15:05,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:15:05,384 INFO L87 Difference]: Start difference. First operand 1117 states and 3909 transitions. Second operand 7 states. [2018-10-04 12:15:07,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:07,969 INFO L93 Difference]: Finished difference Result 1708 states and 5233 transitions. [2018-10-04 12:15:07,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:15:07,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:15:07,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:07,977 INFO L225 Difference]: With dead ends: 1708 [2018-10-04 12:15:07,977 INFO L226 Difference]: Without dead ends: 1702 [2018-10-04 12:15:07,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:15:07,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-10-04 12:15:08,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1210. [2018-10-04 12:15:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2018-10-04 12:15:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4307 transitions. [2018-10-04 12:15:08,522 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 4307 transitions. Word has length 8 [2018-10-04 12:15:08,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:08,522 INFO L480 AbstractCegarLoop]: Abstraction has 1210 states and 4307 transitions. [2018-10-04 12:15:08,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:15:08,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 4307 transitions. [2018-10-04 12:15:08,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:15:08,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:08,523 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:08,524 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:08,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:08,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256941, now seen corresponding path program 1 times [2018-10-04 12:15:08,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:08,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:08,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:08,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:08,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:08,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:15:08,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:15:08,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:15:08,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:15:08,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:15:08,628 INFO L87 Difference]: Start difference. First operand 1210 states and 4307 transitions. Second operand 7 states. [2018-10-04 12:15:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:11,993 INFO L93 Difference]: Finished difference Result 2402 states and 7321 transitions. [2018-10-04 12:15:11,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:15:11,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:15:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:12,000 INFO L225 Difference]: With dead ends: 2402 [2018-10-04 12:15:12,001 INFO L226 Difference]: Without dead ends: 2396 [2018-10-04 12:15:12,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:15:12,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-10-04 12:15:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1341. [2018-10-04 12:15:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-10-04 12:15:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4862 transitions. [2018-10-04 12:15:12,647 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4862 transitions. Word has length 8 [2018-10-04 12:15:12,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:12,647 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4862 transitions. [2018-10-04 12:15:12,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:15:12,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4862 transitions. [2018-10-04 12:15:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:15:12,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:12,649 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:12,649 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:12,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:12,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256944, now seen corresponding path program 1 times [2018-10-04 12:15:12,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:12,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:12,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:12,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:12,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:12,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:12,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:15:12,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:15:12,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:15:12,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:15:12,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:15:12,757 INFO L87 Difference]: Start difference. First operand 1341 states and 4862 transitions. Second operand 7 states. [2018-10-04 12:15:15,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:15,830 INFO L93 Difference]: Finished difference Result 2274 states and 6934 transitions. [2018-10-04 12:15:15,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:15:15,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 12:15:15,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:15,835 INFO L225 Difference]: With dead ends: 2274 [2018-10-04 12:15:15,835 INFO L226 Difference]: Without dead ends: 2268 [2018-10-04 12:15:15,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:15:15,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2018-10-04 12:15:16,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1337. [2018-10-04 12:15:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-10-04 12:15:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 4840 transitions. [2018-10-04 12:15:16,466 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 4840 transitions. Word has length 8 [2018-10-04 12:15:16,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:16,466 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 4840 transitions. [2018-10-04 12:15:16,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:15:16,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 4840 transitions. [2018-10-04 12:15:16,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:15:16,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:16,468 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-04 12:15:16,468 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:16,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:16,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1621267991, now seen corresponding path program 1 times [2018-10-04 12:15:16,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:16,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:16,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:16,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:16,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:16,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:15:16,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:15:16,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:15:16,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:15:16,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:15:16,506 INFO L87 Difference]: Start difference. First operand 1337 states and 4840 transitions. Second operand 4 states. [2018-10-04 12:15:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:17,511 INFO L93 Difference]: Finished difference Result 2170 states and 7637 transitions. [2018-10-04 12:15:17,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:15:17,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-04 12:15:17,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:17,514 INFO L225 Difference]: With dead ends: 2170 [2018-10-04 12:15:17,514 INFO L226 Difference]: Without dead ends: 1253 [2018-10-04 12:15:17,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:15:17,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-10-04 12:15:18,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1080. [2018-10-04 12:15:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-10-04 12:15:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3769 transitions. [2018-10-04 12:15:18,010 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3769 transitions. Word has length 8 [2018-10-04 12:15:18,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:18,010 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 3769 transitions. [2018-10-04 12:15:18,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:15:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3769 transitions. [2018-10-04 12:15:18,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:15:18,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:18,011 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:18,012 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:18,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:18,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283460, now seen corresponding path program 1 times [2018-10-04 12:15:18,012 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:18,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:18,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:18,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:18,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:18,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:15:18,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:15:18,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:15:18,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:15:18,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:15:18,183 INFO L87 Difference]: Start difference. First operand 1080 states and 3769 transitions. Second operand 8 states. [2018-10-04 12:15:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:21,883 INFO L93 Difference]: Finished difference Result 2095 states and 6316 transitions. [2018-10-04 12:15:21,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:15:21,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:15:21,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:21,887 INFO L225 Difference]: With dead ends: 2095 [2018-10-04 12:15:21,888 INFO L226 Difference]: Without dead ends: 2093 [2018-10-04 12:15:21,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:15:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-10-04 12:15:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1161. [2018-10-04 12:15:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2018-10-04 12:15:22,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 4123 transitions. [2018-10-04 12:15:22,491 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 4123 transitions. Word has length 8 [2018-10-04 12:15:22,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:22,491 INFO L480 AbstractCegarLoop]: Abstraction has 1161 states and 4123 transitions. [2018-10-04 12:15:22,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:15:22,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 4123 transitions. [2018-10-04 12:15:22,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:15:22,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:22,492 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:22,493 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:22,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:22,493 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283333, now seen corresponding path program 1 times [2018-10-04 12:15:22,493 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:22,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:22,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:22,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:22,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:22,904 WARN L178 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-10-04 12:15:23,255 WARN L178 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-10-04 12:15:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:23,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:15:23,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:15:23,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:15:23,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:15:23,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:15:23,308 INFO L87 Difference]: Start difference. First operand 1161 states and 4123 transitions. Second operand 8 states. [2018-10-04 12:15:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:26,970 INFO L93 Difference]: Finished difference Result 1994 states and 5988 transitions. [2018-10-04 12:15:26,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:15:26,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:15:26,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:26,974 INFO L225 Difference]: With dead ends: 1994 [2018-10-04 12:15:26,974 INFO L226 Difference]: Without dead ends: 1988 [2018-10-04 12:15:26,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:15:26,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-10-04 12:15:27,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1152. [2018-10-04 12:15:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-10-04 12:15:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 4099 transitions. [2018-10-04 12:15:27,536 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 4099 transitions. Word has length 8 [2018-10-04 12:15:27,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:27,536 INFO L480 AbstractCegarLoop]: Abstraction has 1152 states and 4099 transitions. [2018-10-04 12:15:27,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:15:27,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 4099 transitions. [2018-10-04 12:15:27,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:15:27,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:27,538 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:27,538 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:27,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:27,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1867882049, now seen corresponding path program 1 times [2018-10-04 12:15:27,538 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:27,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:27,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:27,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:27,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:27,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:15:27,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:15:27,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:15:27,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:15:27,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:15:27,658 INFO L87 Difference]: Start difference. First operand 1152 states and 4099 transitions. Second operand 8 states. [2018-10-04 12:15:31,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:31,898 INFO L93 Difference]: Finished difference Result 2160 states and 6516 transitions. [2018-10-04 12:15:31,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:15:31,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:15:31,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:31,904 INFO L225 Difference]: With dead ends: 2160 [2018-10-04 12:15:31,904 INFO L226 Difference]: Without dead ends: 2154 [2018-10-04 12:15:31,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:15:31,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2018-10-04 12:15:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1174. [2018-10-04 12:15:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-10-04 12:15:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4164 transitions. [2018-10-04 12:15:32,547 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 4164 transitions. Word has length 8 [2018-10-04 12:15:32,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:32,547 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 4164 transitions. [2018-10-04 12:15:32,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:15:32,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 4164 transitions. [2018-10-04 12:15:32,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:15:32,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:32,548 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:32,549 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:32,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:32,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1867881922, now seen corresponding path program 1 times [2018-10-04 12:15:32,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:32,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:32,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:32,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:32,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:32,777 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-10-04 12:15:32,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:32,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:15:32,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:15:32,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:15:32,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:15:32,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:15:32,829 INFO L87 Difference]: Start difference. First operand 1174 states and 4164 transitions. Second operand 8 states. [2018-10-04 12:15:36,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:36,970 INFO L93 Difference]: Finished difference Result 2094 states and 6271 transitions. [2018-10-04 12:15:36,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:15:36,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:15:36,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:36,973 INFO L225 Difference]: With dead ends: 2094 [2018-10-04 12:15:36,974 INFO L226 Difference]: Without dead ends: 2088 [2018-10-04 12:15:36,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:15:36,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2018-10-04 12:15:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1153. [2018-10-04 12:15:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-10-04 12:15:37,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 4095 transitions. [2018-10-04 12:15:37,621 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 4095 transitions. Word has length 8 [2018-10-04 12:15:37,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:37,621 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 4095 transitions. [2018-10-04 12:15:37,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:15:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 4095 transitions. [2018-10-04 12:15:37,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:15:37,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:37,623 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-04 12:15:37,623 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:37,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:37,623 INFO L82 PathProgramCache]: Analyzing trace with hash -896988374, now seen corresponding path program 1 times [2018-10-04 12:15:37,623 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:37,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:37,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:37,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:37,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:37,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:15:37,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:15:37,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:15:37,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:15:37,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:15:37,674 INFO L87 Difference]: Start difference. First operand 1153 states and 4095 transitions. Second operand 4 states. [2018-10-04 12:15:38,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:38,684 INFO L93 Difference]: Finished difference Result 1929 states and 6604 transitions. [2018-10-04 12:15:38,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:15:38,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-04 12:15:38,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:38,687 INFO L225 Difference]: With dead ends: 1929 [2018-10-04 12:15:38,687 INFO L226 Difference]: Without dead ends: 1400 [2018-10-04 12:15:38,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:15:38,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2018-10-04 12:15:39,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1083. [2018-10-04 12:15:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2018-10-04 12:15:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3765 transitions. [2018-10-04 12:15:39,295 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 3765 transitions. Word has length 8 [2018-10-04 12:15:39,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:39,295 INFO L480 AbstractCegarLoop]: Abstraction has 1083 states and 3765 transitions. [2018-10-04 12:15:39,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:15:39,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 3765 transitions. [2018-10-04 12:15:39,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:15:39,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:39,296 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:39,297 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:39,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:39,297 INFO L82 PathProgramCache]: Analyzing trace with hash -896379114, now seen corresponding path program 1 times [2018-10-04 12:15:39,297 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:39,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:39,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:39,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:39,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:39,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:39,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:15:39,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:15:39,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:15:39,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:15:39,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:15:39,401 INFO L87 Difference]: Start difference. First operand 1083 states and 3765 transitions. Second operand 8 states. [2018-10-04 12:15:43,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:43,214 INFO L93 Difference]: Finished difference Result 2276 states and 6948 transitions. [2018-10-04 12:15:43,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:15:43,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:15:43,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:43,218 INFO L225 Difference]: With dead ends: 2276 [2018-10-04 12:15:43,219 INFO L226 Difference]: Without dead ends: 2270 [2018-10-04 12:15:43,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:15:43,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2018-10-04 12:15:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1266. [2018-10-04 12:15:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2018-10-04 12:15:44,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4418 transitions. [2018-10-04 12:15:44,208 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 4418 transitions. Word has length 8 [2018-10-04 12:15:44,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:44,208 INFO L480 AbstractCegarLoop]: Abstraction has 1266 states and 4418 transitions. [2018-10-04 12:15:44,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:15:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 4418 transitions. [2018-10-04 12:15:44,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:15:44,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:44,210 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:44,210 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:44,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:44,211 INFO L82 PathProgramCache]: Analyzing trace with hash -896379111, now seen corresponding path program 1 times [2018-10-04 12:15:44,211 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:44,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:44,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:44,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:44,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:44,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:15:44,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:15:44,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:15:44,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:15:44,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:15:44,304 INFO L87 Difference]: Start difference. First operand 1266 states and 4418 transitions. Second operand 8 states. [2018-10-04 12:15:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:48,548 INFO L93 Difference]: Finished difference Result 2425 states and 7363 transitions. [2018-10-04 12:15:48,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:15:48,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:15:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:48,553 INFO L225 Difference]: With dead ends: 2425 [2018-10-04 12:15:48,553 INFO L226 Difference]: Without dead ends: 2419 [2018-10-04 12:15:48,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:15:48,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2018-10-04 12:15:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1373. [2018-10-04 12:15:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2018-10-04 12:15:49,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 4822 transitions. [2018-10-04 12:15:49,545 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 4822 transitions. Word has length 8 [2018-10-04 12:15:49,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:49,546 INFO L480 AbstractCegarLoop]: Abstraction has 1373 states and 4822 transitions. [2018-10-04 12:15:49,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:15:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 4822 transitions. [2018-10-04 12:15:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:15:49,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:49,547 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:49,548 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:49,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:49,548 INFO L82 PathProgramCache]: Analyzing trace with hash -881085998, now seen corresponding path program 1 times [2018-10-04 12:15:49,548 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:49,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:49,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:49,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:49,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:49,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:49,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:15:49,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:15:49,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:15:49,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:15:49,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:15:49,635 INFO L87 Difference]: Start difference. First operand 1373 states and 4822 transitions. Second operand 8 states. [2018-10-04 12:15:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:54,224 INFO L93 Difference]: Finished difference Result 2278 states and 6952 transitions. [2018-10-04 12:15:54,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:15:54,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:15:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:54,230 INFO L225 Difference]: With dead ends: 2278 [2018-10-04 12:15:54,230 INFO L226 Difference]: Without dead ends: 2272 [2018-10-04 12:15:54,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:15:54,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2018-10-04 12:15:55,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1421. [2018-10-04 12:15:55,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2018-10-04 12:15:55,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 4963 transitions. [2018-10-04 12:15:55,231 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 4963 transitions. Word has length 8 [2018-10-04 12:15:55,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:55,231 INFO L480 AbstractCegarLoop]: Abstraction has 1421 states and 4963 transitions. [2018-10-04 12:15:55,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:15:55,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 4963 transitions. [2018-10-04 12:15:55,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:15:55,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:55,233 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:55,233 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:55,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:55,233 INFO L82 PathProgramCache]: Analyzing trace with hash -881086125, now seen corresponding path program 1 times [2018-10-04 12:15:55,233 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:55,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:55,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:55,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:55,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:55,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:15:55,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:15:55,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:15:55,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:15:55,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:15:55,338 INFO L87 Difference]: Start difference. First operand 1421 states and 4963 transitions. Second operand 8 states. [2018-10-04 12:15:59,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:59,605 INFO L93 Difference]: Finished difference Result 2233 states and 6848 transitions. [2018-10-04 12:15:59,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:15:59,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:15:59,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:59,610 INFO L225 Difference]: With dead ends: 2233 [2018-10-04 12:15:59,610 INFO L226 Difference]: Without dead ends: 2227 [2018-10-04 12:15:59,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:15:59,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2018-10-04 12:16:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1411. [2018-10-04 12:16:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-10-04 12:16:00,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 4926 transitions. [2018-10-04 12:16:00,561 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 4926 transitions. Word has length 8 [2018-10-04 12:16:00,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:00,562 INFO L480 AbstractCegarLoop]: Abstraction has 1411 states and 4926 transitions. [2018-10-04 12:16:00,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:16:00,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 4926 transitions. [2018-10-04 12:16:00,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:16:00,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:00,563 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:00,563 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:00,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:00,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099334, now seen corresponding path program 1 times [2018-10-04 12:16:00,563 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:00,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:00,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:00,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:00,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:00,841 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2018-10-04 12:16:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:00,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:16:00,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:16:00,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:16:00,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:16:00,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:16:00,917 INFO L87 Difference]: Start difference. First operand 1411 states and 4926 transitions. Second operand 8 states. [2018-10-04 12:16:05,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:05,593 INFO L93 Difference]: Finished difference Result 2558 states and 7836 transitions. [2018-10-04 12:16:05,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:16:05,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:16:05,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:05,599 INFO L225 Difference]: With dead ends: 2558 [2018-10-04 12:16:05,599 INFO L226 Difference]: Without dead ends: 2552 [2018-10-04 12:16:05,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:16:05,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-10-04 12:16:06,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1471. [2018-10-04 12:16:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2018-10-04 12:16:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 5183 transitions. [2018-10-04 12:16:06,636 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 5183 transitions. Word has length 8 [2018-10-04 12:16:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:06,636 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 5183 transitions. [2018-10-04 12:16:06,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:16:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 5183 transitions. [2018-10-04 12:16:06,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:16:06,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:06,638 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:06,638 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:06,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:06,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099337, now seen corresponding path program 1 times [2018-10-04 12:16:06,638 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:06,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:06,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:06,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:06,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:06,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:06,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:16:06,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:16:06,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:16:06,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:16:06,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:16:06,762 INFO L87 Difference]: Start difference. First operand 1471 states and 5183 transitions. Second operand 8 states. [2018-10-04 12:16:06,897 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-04 12:16:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:11,658 INFO L93 Difference]: Finished difference Result 2703 states and 8278 transitions. [2018-10-04 12:16:11,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:16:11,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:16:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:11,663 INFO L225 Difference]: With dead ends: 2703 [2018-10-04 12:16:11,664 INFO L226 Difference]: Without dead ends: 2697 [2018-10-04 12:16:11,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:16:11,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2018-10-04 12:16:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1480. [2018-10-04 12:16:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-10-04 12:16:12,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5200 transitions. [2018-10-04 12:16:12,828 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5200 transitions. Word has length 8 [2018-10-04 12:16:12,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:12,828 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5200 transitions. [2018-10-04 12:16:12,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:16:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5200 transitions. [2018-10-04 12:16:12,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:16:12,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:12,829 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:12,829 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:12,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:12,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629971, now seen corresponding path program 1 times [2018-10-04 12:16:12,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:12,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:12,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:12,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:12,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:13,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:16:13,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:16:13,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:16:13,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:16:13,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:16:13,070 INFO L87 Difference]: Start difference. First operand 1480 states and 5200 transitions. Second operand 8 states. [2018-10-04 12:16:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:18,266 INFO L93 Difference]: Finished difference Result 2674 states and 8171 transitions. [2018-10-04 12:16:18,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:16:18,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:16:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:18,273 INFO L225 Difference]: With dead ends: 2674 [2018-10-04 12:16:18,273 INFO L226 Difference]: Without dead ends: 2668 [2018-10-04 12:16:18,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:16:18,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2018-10-04 12:16:19,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 1480. [2018-10-04 12:16:19,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-10-04 12:16:19,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5196 transitions. [2018-10-04 12:16:19,393 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5196 transitions. Word has length 8 [2018-10-04 12:16:19,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:19,393 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5196 transitions. [2018-10-04 12:16:19,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:16:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5196 transitions. [2018-10-04 12:16:19,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:16:19,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:19,394 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:19,394 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:19,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:19,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629974, now seen corresponding path program 1 times [2018-10-04 12:16:19,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:19,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:19,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:19,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:19,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:19,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:16:19,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:16:19,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:16:19,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:16:19,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:16:19,528 INFO L87 Difference]: Start difference. First operand 1480 states and 5196 transitions. Second operand 8 states. [2018-10-04 12:16:25,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:25,106 INFO L93 Difference]: Finished difference Result 2722 states and 8299 transitions. [2018-10-04 12:16:25,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:16:25,107 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:16:25,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:25,112 INFO L225 Difference]: With dead ends: 2722 [2018-10-04 12:16:25,112 INFO L226 Difference]: Without dead ends: 2716 [2018-10-04 12:16:25,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-10-04 12:16:25,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2018-10-04 12:16:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 1462. [2018-10-04 12:16:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2018-10-04 12:16:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 5124 transitions. [2018-10-04 12:16:26,190 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 5124 transitions. Word has length 8 [2018-10-04 12:16:26,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:26,191 INFO L480 AbstractCegarLoop]: Abstraction has 1462 states and 5124 transitions. [2018-10-04 12:16:26,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:16:26,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 5124 transitions. [2018-10-04 12:16:26,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:16:26,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:26,192 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:26,192 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:26,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:26,192 INFO L82 PathProgramCache]: Analyzing trace with hash 278041308, now seen corresponding path program 1 times [2018-10-04 12:16:26,192 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:26,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:26,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:26,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:26,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:26,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:16:26,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:16:26,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:16:26,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:16:26,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:16:26,265 INFO L87 Difference]: Start difference. First operand 1462 states and 5124 transitions. Second operand 8 states. [2018-10-04 12:16:31,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:31,348 INFO L93 Difference]: Finished difference Result 2962 states and 9218 transitions. [2018-10-04 12:16:31,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:16:31,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 12:16:31,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:31,354 INFO L225 Difference]: With dead ends: 2962 [2018-10-04 12:16:31,354 INFO L226 Difference]: Without dead ends: 2956 [2018-10-04 12:16:31,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:16:31,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2018-10-04 12:16:32,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1776. [2018-10-04 12:16:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-10-04 12:16:32,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 6236 transitions. [2018-10-04 12:16:32,885 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 6236 transitions. Word has length 9 [2018-10-04 12:16:32,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:32,885 INFO L480 AbstractCegarLoop]: Abstraction has 1776 states and 6236 transitions. [2018-10-04 12:16:32,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:16:32,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 6236 transitions. [2018-10-04 12:16:32,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:16:32,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:32,886 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:32,886 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:32,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:32,887 INFO L82 PathProgramCache]: Analyzing trace with hash 278041683, now seen corresponding path program 1 times [2018-10-04 12:16:32,887 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:32,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:32,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:32,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:32,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:33,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-10-04 12:16:33,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:16:33,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:16:33,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:16:33,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:16:33,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:16:33,189 INFO L87 Difference]: Start difference. First operand 1776 states and 6236 transitions. Second operand 8 states. [2018-10-04 12:16:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:38,320 INFO L93 Difference]: Finished difference Result 2948 states and 9162 transitions. [2018-10-04 12:16:38,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:16:38,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 12:16:38,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:38,326 INFO L225 Difference]: With dead ends: 2948 [2018-10-04 12:16:38,327 INFO L226 Difference]: Without dead ends: 2942 [2018-10-04 12:16:38,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:16:38,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2018-10-04 12:16:39,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1772. [2018-10-04 12:16:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-10-04 12:16:39,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 6220 transitions. [2018-10-04 12:16:39,772 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 6220 transitions. Word has length 9 [2018-10-04 12:16:39,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:39,773 INFO L480 AbstractCegarLoop]: Abstraction has 1772 states and 6220 transitions. [2018-10-04 12:16:39,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:16:39,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 6220 transitions. [2018-10-04 12:16:39,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:16:39,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:39,774 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:39,774 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:39,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:39,774 INFO L82 PathProgramCache]: Analyzing trace with hash 541105076, now seen corresponding path program 1 times [2018-10-04 12:16:39,774 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:39,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:39,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:39,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:39,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:39,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:16:39,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:16:39,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:16:39,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:16:39,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:16:39,906 INFO L87 Difference]: Start difference. First operand 1772 states and 6220 transitions. Second operand 8 states. [2018-10-04 12:16:46,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:46,020 INFO L93 Difference]: Finished difference Result 3238 states and 9970 transitions. [2018-10-04 12:16:46,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:16:46,020 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 12:16:46,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:46,026 INFO L225 Difference]: With dead ends: 3238 [2018-10-04 12:16:46,026 INFO L226 Difference]: Without dead ends: 3232 [2018-10-04 12:16:46,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:16:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2018-10-04 12:16:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1799. [2018-10-04 12:16:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-10-04 12:16:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 6288 transitions. [2018-10-04 12:16:47,652 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 6288 transitions. Word has length 9 [2018-10-04 12:16:47,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:47,653 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 6288 transitions. [2018-10-04 12:16:47,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:16:47,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 6288 transitions. [2018-10-04 12:16:47,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:16:47,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:47,654 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:47,654 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:47,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:47,655 INFO L82 PathProgramCache]: Analyzing trace with hash 541105451, now seen corresponding path program 1 times [2018-10-04 12:16:47,655 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:47,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:47,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:47,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:47,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:47,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:16:47,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:16:47,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:16:47,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:16:47,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:16:47,753 INFO L87 Difference]: Start difference. First operand 1799 states and 6288 transitions. Second operand 8 states. [2018-10-04 12:16:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:54,171 INFO L93 Difference]: Finished difference Result 3212 states and 9854 transitions. [2018-10-04 12:16:54,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:16:54,171 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 12:16:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:54,178 INFO L225 Difference]: With dead ends: 3212 [2018-10-04 12:16:54,178 INFO L226 Difference]: Without dead ends: 3206 [2018-10-04 12:16:54,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:16:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2018-10-04 12:16:55,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 1737. [2018-10-04 12:16:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2018-10-04 12:16:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 6062 transitions. [2018-10-04 12:16:55,735 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 6062 transitions. Word has length 9 [2018-10-04 12:16:55,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:55,735 INFO L480 AbstractCegarLoop]: Abstraction has 1737 states and 6062 transitions. [2018-10-04 12:16:55,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:16:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 6062 transitions. [2018-10-04 12:16:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:16:55,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:55,736 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:55,737 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:55,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:55,737 INFO L82 PathProgramCache]: Analyzing trace with hash 825189368, now seen corresponding path program 1 times [2018-10-04 12:16:55,737 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:55,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:55,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:55,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:55,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:55,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:16:55,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:16:55,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:16:55,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:16:55,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:16:55,821 INFO L87 Difference]: Start difference. First operand 1737 states and 6062 transitions. Second operand 8 states. [2018-10-04 12:17:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:01,578 INFO L93 Difference]: Finished difference Result 3315 states and 10043 transitions. [2018-10-04 12:17:01,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:17:01,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 12:17:01,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:01,585 INFO L225 Difference]: With dead ends: 3315 [2018-10-04 12:17:01,585 INFO L226 Difference]: Without dead ends: 3309 [2018-10-04 12:17:01,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:17:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2018-10-04 12:17:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 1985. [2018-10-04 12:17:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2018-10-04 12:17:03,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 6886 transitions. [2018-10-04 12:17:03,346 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 6886 transitions. Word has length 9 [2018-10-04 12:17:03,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:03,347 INFO L480 AbstractCegarLoop]: Abstraction has 1985 states and 6886 transitions. [2018-10-04 12:17:03,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:17:03,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 6886 transitions. [2018-10-04 12:17:03,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:17:03,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:03,348 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:03,348 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:03,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:03,348 INFO L82 PathProgramCache]: Analyzing trace with hash 825189371, now seen corresponding path program 1 times [2018-10-04 12:17:03,349 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:03,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:03,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:03,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:03,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:03,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:17:03,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:17:03,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:17:03,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:17:03,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:17:03,636 INFO L87 Difference]: Start difference. First operand 1985 states and 6886 transitions. Second operand 8 states. [2018-10-04 12:17:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:10,193 INFO L93 Difference]: Finished difference Result 3446 states and 10415 transitions. [2018-10-04 12:17:10,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:17:10,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 12:17:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:10,200 INFO L225 Difference]: With dead ends: 3446 [2018-10-04 12:17:10,200 INFO L226 Difference]: Without dead ends: 3440 [2018-10-04 12:17:10,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:17:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2018-10-04 12:17:11,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 1927. [2018-10-04 12:17:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1927 states. [2018-10-04 12:17:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 6663 transitions. [2018-10-04 12:17:11,992 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 6663 transitions. Word has length 9 [2018-10-04 12:17:11,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:11,992 INFO L480 AbstractCegarLoop]: Abstraction has 1927 states and 6663 transitions. [2018-10-04 12:17:11,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:17:11,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 6663 transitions. [2018-10-04 12:17:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:17:11,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:11,993 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:11,994 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:11,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:11,994 INFO L82 PathProgramCache]: Analyzing trace with hash 832700792, now seen corresponding path program 1 times [2018-10-04 12:17:11,994 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:11,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:11,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:11,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:11,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:12,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:17:12,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:17:12,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:17:12,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:17:12,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:17:12,090 INFO L87 Difference]: Start difference. First operand 1927 states and 6663 transitions. Second operand 8 states. [2018-10-04 12:17:17,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:17,624 INFO L93 Difference]: Finished difference Result 2832 states and 8631 transitions. [2018-10-04 12:17:17,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:17:17,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 12:17:17,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:17,630 INFO L225 Difference]: With dead ends: 2832 [2018-10-04 12:17:17,630 INFO L226 Difference]: Without dead ends: 2824 [2018-10-04 12:17:17,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:17:17,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2018-10-04 12:17:19,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 1904. [2018-10-04 12:17:19,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-10-04 12:17:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 6553 transitions. [2018-10-04 12:17:19,442 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 6553 transitions. Word has length 9 [2018-10-04 12:17:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:19,443 INFO L480 AbstractCegarLoop]: Abstraction has 1904 states and 6553 transitions. [2018-10-04 12:17:19,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:17:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 6553 transitions. [2018-10-04 12:17:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:17:19,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:19,444 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:19,444 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:19,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:19,444 INFO L82 PathProgramCache]: Analyzing trace with hash -595843680, now seen corresponding path program 1 times [2018-10-04 12:17:19,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:19,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:19,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:19,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:19,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:19,645 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-04 12:17:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:19,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:17:19,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:17:19,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:17:19,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:17:19,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:17:19,986 INFO L87 Difference]: Start difference. First operand 1904 states and 6553 transitions. Second operand 9 states. [2018-10-04 12:17:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:25,892 INFO L93 Difference]: Finished difference Result 3157 states and 9716 transitions. [2018-10-04 12:17:25,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:17:25,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 12:17:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:25,898 INFO L225 Difference]: With dead ends: 3157 [2018-10-04 12:17:25,899 INFO L226 Difference]: Without dead ends: 3151 [2018-10-04 12:17:25,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:17:25,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2018-10-04 12:17:27,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 1949. [2018-10-04 12:17:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2018-10-04 12:17:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 6722 transitions. [2018-10-04 12:17:27,791 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 6722 transitions. Word has length 9 [2018-10-04 12:17:27,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:27,791 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 6722 transitions. [2018-10-04 12:17:27,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:17:27,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 6722 transitions. [2018-10-04 12:17:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:17:27,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:27,792 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:27,793 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:27,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:27,793 INFO L82 PathProgramCache]: Analyzing trace with hash -595843677, now seen corresponding path program 1 times [2018-10-04 12:17:27,793 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:27,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:27,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:27,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:27,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:27,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:17:27,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:17:27,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:17:27,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:17:27,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:17:27,921 INFO L87 Difference]: Start difference. First operand 1949 states and 6722 transitions. Second operand 9 states. [2018-10-04 12:17:36,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:36,426 INFO L93 Difference]: Finished difference Result 3822 states and 11523 transitions. [2018-10-04 12:17:36,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:17:36,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 12:17:36,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:36,434 INFO L225 Difference]: With dead ends: 3822 [2018-10-04 12:17:36,434 INFO L226 Difference]: Without dead ends: 3816 [2018-10-04 12:17:36,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2018-10-04 12:17:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2018-10-04 12:17:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 2098. [2018-10-04 12:17:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-10-04 12:17:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 7405 transitions. [2018-10-04 12:17:38,553 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 7405 transitions. Word has length 9 [2018-10-04 12:17:38,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:38,554 INFO L480 AbstractCegarLoop]: Abstraction has 2098 states and 7405 transitions. [2018-10-04 12:17:38,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:17:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 7405 transitions. [2018-10-04 12:17:38,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:17:38,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:38,555 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:38,556 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:38,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:38,556 INFO L82 PathProgramCache]: Analyzing trace with hash -204435682, now seen corresponding path program 1 times [2018-10-04 12:17:38,556 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:38,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:38,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:38,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:38,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:38,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:17:38,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:17:38,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:17:38,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:17:38,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:17:38,707 INFO L87 Difference]: Start difference. First operand 2098 states and 7405 transitions. Second operand 9 states. [2018-10-04 12:17:47,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:47,798 INFO L93 Difference]: Finished difference Result 4144 states and 12499 transitions. [2018-10-04 12:17:47,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:17:47,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 12:17:47,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:47,807 INFO L225 Difference]: With dead ends: 4144 [2018-10-04 12:17:47,807 INFO L226 Difference]: Without dead ends: 4138 [2018-10-04 12:17:47,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2018-10-04 12:17:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2018-10-04 12:17:50,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 2260. [2018-10-04 12:17:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2018-10-04 12:17:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 7995 transitions. [2018-10-04 12:17:50,300 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 7995 transitions. Word has length 9 [2018-10-04 12:17:50,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:50,300 INFO L480 AbstractCegarLoop]: Abstraction has 2260 states and 7995 transitions. [2018-10-04 12:17:50,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:17:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 7995 transitions. [2018-10-04 12:17:50,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:17:50,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:50,302 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:50,302 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:50,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:50,302 INFO L82 PathProgramCache]: Analyzing trace with hash -204435307, now seen corresponding path program 1 times [2018-10-04 12:17:50,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:50,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:50,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:50,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:50,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:50,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:17:50,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:17:50,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:17:50,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:17:50,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:17:50,522 INFO L87 Difference]: Start difference. First operand 2260 states and 7995 transitions. Second operand 9 states. [2018-10-04 12:17:57,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:57,906 INFO L93 Difference]: Finished difference Result 3320 states and 10163 transitions. [2018-10-04 12:17:57,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:17:57,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 12:17:57,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:57,912 INFO L225 Difference]: With dead ends: 3320 [2018-10-04 12:17:57,913 INFO L226 Difference]: Without dead ends: 3314 [2018-10-04 12:17:57,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-10-04 12:17:57,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2018-10-04 12:18:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 2191. [2018-10-04 12:18:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2191 states. [2018-10-04 12:18:00,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 7721 transitions. [2018-10-04 12:18:00,491 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 7721 transitions. Word has length 9 [2018-10-04 12:18:00,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:00,492 INFO L480 AbstractCegarLoop]: Abstraction has 2191 states and 7721 transitions. [2018-10-04 12:18:00,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:18:00,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 7721 transitions. [2018-10-04 12:18:00,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:18:00,493 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:00,494 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:18:00,494 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:00,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:00,494 INFO L82 PathProgramCache]: Analyzing trace with hash -966522519, now seen corresponding path program 1 times [2018-10-04 12:18:00,494 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:00,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:00,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:00,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:00,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:00,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:00,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:18:00,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:18:00,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:18:00,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:18:00,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:18:00,738 INFO L87 Difference]: Start difference. First operand 2191 states and 7721 transitions. Second operand 8 states. [2018-10-04 12:18:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:10,367 INFO L93 Difference]: Finished difference Result 4113 states and 13014 transitions. [2018-10-04 12:18:10,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:18:10,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 12:18:10,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:10,377 INFO L225 Difference]: With dead ends: 4113 [2018-10-04 12:18:10,377 INFO L226 Difference]: Without dead ends: 4107 [2018-10-04 12:18:10,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:18:10,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2018-10-04 12:18:12,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 2224. [2018-10-04 12:18:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2018-10-04 12:18:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 7857 transitions. [2018-10-04 12:18:12,849 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 7857 transitions. Word has length 9 [2018-10-04 12:18:12,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:12,849 INFO L480 AbstractCegarLoop]: Abstraction has 2224 states and 7857 transitions. [2018-10-04 12:18:12,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:18:12,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 7857 transitions. [2018-10-04 12:18:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:18:12,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:12,850 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:18:12,850 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:12,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:12,851 INFO L82 PathProgramCache]: Analyzing trace with hash -966522144, now seen corresponding path program 1 times [2018-10-04 12:18:12,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:12,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:12,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:12,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:12,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:13,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:18:13,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 12:18:13,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:18:13,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:18:13,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:18:13,127 INFO L87 Difference]: Start difference. First operand 2224 states and 7857 transitions. Second operand 8 states. Received shutdown request... [2018-10-04 12:18:19,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:18:19,569 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 12:18:19,576 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 12:18:19,577 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:18:19 BoogieIcfgContainer [2018-10-04 12:18:19,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:18:19,578 INFO L168 Benchmark]: Toolchain (without parser) took 263096.75 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -528.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-04 12:18:19,579 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:18:19,579 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:18:19,580 INFO L168 Benchmark]: Boogie Preprocessor took 56.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:18:19,580 INFO L168 Benchmark]: RCFGBuilder took 1175.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-04 12:18:19,580 INFO L168 Benchmark]: TraceAbstraction took 261796.35 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -571.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-04 12:18:19,584 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.23 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 63.83 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 56.00 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 1175.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 261796.35 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -571.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 446]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 446). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 263]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 263). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 847]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 223]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 223). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 71). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 800]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 800). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 95). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 316]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 316). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 194]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 194). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 337). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 599]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 599). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 816]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 816). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 624]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 624). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 470]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 470). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 584]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 584). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 199). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 604]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 604). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2268 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 27 error locations. TIMEOUT Result, 261.7s OverallTime, 53 OverallIterations, 2 TraceHistogramMax, 210.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14968 SDtfs, 26584 SDslu, 28629 SDs, 0 SdLazy, 102556 SolverSat, 9511 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 100.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 821 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 817 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2149 ImplicationChecksByTransitivity, 18.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2260occurred in iteration=50, 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: 41.4s AutomataMinimizationTime, 52 MinimizatonAttempts, 43801 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 428 NumberOfCodeBlocks, 428 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 375 ConstructedInterpolants, 0 QuantifiedInterpolants, 25219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 53 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-18-19-596.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-18-19-596.csv Completed graceful shutdown