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-1cc990c [2018-09-30 23:06:18,294 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 23:06:18,296 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 23:06:18,308 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 23:06:18,309 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 23:06:18,310 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 23:06:18,311 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 23:06:18,313 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 23:06:18,314 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 23:06:18,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 23:06:18,318 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 23:06:18,318 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 23:06:18,319 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 23:06:18,320 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 23:06:18,323 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 23:06:18,326 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 23:06:18,327 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 23:06:18,329 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 23:06:18,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 23:06:18,342 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 23:06:18,344 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 23:06:18,348 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 23:06:18,352 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 23:06:18,352 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 23:06:18,352 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 23:06:18,353 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 23:06:18,357 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 23:06:18,358 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 23:06:18,361 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 23:06:18,363 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 23:06:18,363 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 23:06:18,364 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 23:06:18,364 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 23:06:18,365 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 23:06:18,368 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 23:06:18,368 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 23:06:18,369 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 23:06:18,395 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 23:06:18,395 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 23:06:18,397 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 23:06:18,397 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 23:06:18,398 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 23:06:18,398 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 23:06:18,398 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 23:06:18,398 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 23:06:18,399 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 23:06:18,399 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 23:06:18,399 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 23:06:18,399 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 23:06:18,399 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 23:06:18,399 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 23:06:18,400 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 23:06:18,400 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 23:06:18,400 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 23:06:18,400 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 23:06:18,401 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 23:06:18,402 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 23:06:18,402 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 23:06:18,402 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 23:06:18,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:06:18,402 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 23:06:18,403 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 23:06:18,403 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 23:06:18,403 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 23:06:18,403 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 23:06:18,403 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 23:06:18,403 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 23:06:18,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 23:06:18,488 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 23:06:18,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 23:06:18,497 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 23:06:18,498 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 23:06:18,499 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-09-30 23:06:18,499 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-09-30 23:06:18,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 23:06:18,591 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 23:06:18,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 23:06:18,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 23:06:18,592 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 23:06:18,613 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 30.09 11:06:18" (1/1) ... [2018-09-30 23:06:18,632 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 30.09 11:06:18" (1/1) ... [2018-09-30 23:06:18,646 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 23:06:18,646 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 23:06:18,646 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 23:06:18,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 23:06:18,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 23:06:18,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 23:06:18,658 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 23:06:18,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:18" (1/1) ... [2018-09-30 23:06:18,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:18" (1/1) ... [2018-09-30 23:06:18,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:18" (1/1) ... [2018-09-30 23:06:18,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:18" (1/1) ... [2018-09-30 23:06:18,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:18" (1/1) ... [2018-09-30 23:06:18,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:18" (1/1) ... [2018-09-30 23:06:18,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:18" (1/1) ... [2018-09-30 23:06:18,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 23:06:18,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 23:06:18,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 23:06:18,713 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 23:06:18,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:06:18,789 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 23:06:18,789 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 23:06:18,789 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 23:06:19,909 INFO L345 CfgBuilder]: Using library mode [2018-09-30 23:06:19,910 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:06:19 BoogieIcfgContainer [2018-09-30 23:06:19,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 23:06:19,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 23:06:19,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 23:06:19,914 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 23:06:19,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:18" (1/2) ... [2018-09-30 23:06:19,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b2529f and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 11:06:19, skipping insertion in model container [2018-09-30 23:06:19,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:06:19" (2/2) ... [2018-09-30 23:06:19,918 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-09-30 23:06:19,927 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 23:06:19,937 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-09-30 23:06:19,991 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 23:06:19,991 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 23:06:19,992 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 23:06:19,992 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 23:06:19,992 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 23:06:19,992 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 23:06:19,992 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 23:06:19,992 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 23:06:19,993 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 23:06:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-09-30 23:06:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 23:06:20,020 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:20,021 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 23:06:20,023 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:20,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:20,030 INFO L82 PathProgramCache]: Analyzing trace with hash 45506320, now seen corresponding path program 1 times [2018-09-30 23:06:20,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:20,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:20,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:20,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:20,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:20,371 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:20,372 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:06:20,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 23:06:20,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 23:06:20,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:06:20,390 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 5 states. [2018-09-30 23:06:22,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:22,036 INFO L93 Difference]: Finished difference Result 142 states and 303 transitions. [2018-09-30 23:06:22,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 23:06:22,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 23:06:22,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:22,056 INFO L225 Difference]: With dead ends: 142 [2018-09-30 23:06:22,056 INFO L226 Difference]: Without dead ends: 138 [2018-09-30 23:06:22,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:06:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-30 23:06:22,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2018-09-30 23:06:22,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-30 23:06:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 219 transitions. [2018-09-30 23:06:22,120 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 219 transitions. Word has length 5 [2018-09-30 23:06:22,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:22,123 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 219 transitions. [2018-09-30 23:06:22,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 23:06:22,123 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 219 transitions. [2018-09-30 23:06:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 23:06:22,125 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:22,125 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 23:06:22,128 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:22,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:22,129 INFO L82 PathProgramCache]: Analyzing trace with hash 45756290, now seen corresponding path program 1 times [2018-09-30 23:06:22,129 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:22,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:22,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:22,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:22,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:22,297 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:22,297 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:06:22,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 23:06:22,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 23:06:22,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:06:22,300 INFO L87 Difference]: Start difference. First operand 98 states and 219 transitions. Second operand 5 states. [2018-09-30 23:06:23,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:23,782 INFO L93 Difference]: Finished difference Result 241 states and 539 transitions. [2018-09-30 23:06:23,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 23:06:23,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 23:06:23,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:23,788 INFO L225 Difference]: With dead ends: 241 [2018-09-30 23:06:23,789 INFO L226 Difference]: Without dead ends: 237 [2018-09-30 23:06:23,790 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-09-30 23:06:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-30 23:06:23,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 134. [2018-09-30 23:06:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-30 23:06:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2018-09-30 23:06:23,835 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 5 [2018-09-30 23:06:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:23,835 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2018-09-30 23:06:23,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 23:06:23,836 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2018-09-30 23:06:23,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 23:06:23,839 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:23,839 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 23:06:23,840 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:23,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:23,841 INFO L82 PathProgramCache]: Analyzing trace with hash 28948051, now seen corresponding path program 1 times [2018-09-30 23:06:23,841 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:23,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:23,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:23,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:23,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:23,956 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:23,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:06:23,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 23:06:23,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 23:06:23,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:06:23,958 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 5 states. [2018-09-30 23:06:25,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:25,127 INFO L93 Difference]: Finished difference Result 269 states and 639 transitions. [2018-09-30 23:06:25,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 23:06:25,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 23:06:25,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:25,133 INFO L225 Difference]: With dead ends: 269 [2018-09-30 23:06:25,133 INFO L226 Difference]: Without dead ends: 265 [2018-09-30 23:06:25,134 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-09-30 23:06:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-30 23:06:25,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 162. [2018-09-30 23:06:25,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-30 23:06:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 455 transitions. [2018-09-30 23:06:25,169 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 455 transitions. Word has length 5 [2018-09-30 23:06:25,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:25,170 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 455 transitions. [2018-09-30 23:06:25,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 23:06:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 455 transitions. [2018-09-30 23:06:25,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:06:25,172 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:25,172 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:25,173 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:25,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:25,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558066, now seen corresponding path program 1 times [2018-09-30 23:06:25,173 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:25,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:25,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:25,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:25,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:25,293 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:25,293 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:06:25,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:25,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:25,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:25,294 INFO L87 Difference]: Start difference. First operand 162 states and 455 transitions. Second operand 8 states. [2018-09-30 23:06:30,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:30,103 INFO L93 Difference]: Finished difference Result 790 states and 2085 transitions. [2018-09-30 23:06:30,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 23:06:30,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:06:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:30,114 INFO L225 Difference]: With dead ends: 790 [2018-09-30 23:06:30,114 INFO L226 Difference]: Without dead ends: 629 [2018-09-30 23:06:30,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-09-30 23:06:30,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-09-30 23:06:30,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 278. [2018-09-30 23:06:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-09-30 23:06:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 854 transitions. [2018-09-30 23:06:30,168 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 854 transitions. Word has length 8 [2018-09-30 23:06:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:30,169 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 854 transitions. [2018-09-30 23:06:30,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 854 transitions. [2018-09-30 23:06:30,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:06:30,171 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:30,171 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:30,172 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:30,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:30,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558063, now seen corresponding path program 1 times [2018-09-30 23:06:30,173 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:30,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:30,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:30,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:30,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:30,354 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:30,354 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:06:30,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:30,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:30,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:30,355 INFO L87 Difference]: Start difference. First operand 278 states and 854 transitions. Second operand 8 states. [2018-09-30 23:06:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:33,477 INFO L93 Difference]: Finished difference Result 634 states and 1540 transitions. [2018-09-30 23:06:33,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:06:33,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:06:33,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:33,483 INFO L225 Difference]: With dead ends: 634 [2018-09-30 23:06:33,484 INFO L226 Difference]: Without dead ends: 628 [2018-09-30 23:06:33,485 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-09-30 23:06:33,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-09-30 23:06:33,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 310. [2018-09-30 23:06:33,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-09-30 23:06:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 963 transitions. [2018-09-30 23:06:33,539 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 963 transitions. Word has length 8 [2018-09-30 23:06:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:33,540 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 963 transitions. [2018-09-30 23:06:33,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:33,540 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 963 transitions. [2018-09-30 23:06:33,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:06:33,542 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:33,542 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:33,543 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:33,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:33,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1080099218, now seen corresponding path program 1 times [2018-09-30 23:06:33,543 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:33,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:33,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:33,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:33,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:33,649 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:33,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:06:33,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:33,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:33,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:33,651 INFO L87 Difference]: Start difference. First operand 310 states and 963 transitions. Second operand 8 states. [2018-09-30 23:06:35,192 WARN L178 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 23:06:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:38,166 INFO L93 Difference]: Finished difference Result 768 states and 2087 transitions. [2018-09-30 23:06:38,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 23:06:38,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:06:38,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:38,172 INFO L225 Difference]: With dead ends: 768 [2018-09-30 23:06:38,172 INFO L226 Difference]: Without dead ends: 537 [2018-09-30 23:06:38,173 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-09-30 23:06:38,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-09-30 23:06:38,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 334. [2018-09-30 23:06:38,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-09-30 23:06:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1037 transitions. [2018-09-30 23:06:38,225 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1037 transitions. Word has length 8 [2018-09-30 23:06:38,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:38,225 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1037 transitions. [2018-09-30 23:06:38,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1037 transitions. [2018-09-30 23:06:38,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:06:38,227 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:38,227 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:38,228 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:38,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:38,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595081, now seen corresponding path program 1 times [2018-09-30 23:06:38,228 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:38,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:38,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:38,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:38,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:38,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-09-30 23:06:38,383 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:38,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:06:38,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:38,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:38,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:38,384 INFO L87 Difference]: Start difference. First operand 334 states and 1037 transitions. Second operand 8 states. [2018-09-30 23:06:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:40,743 INFO L93 Difference]: Finished difference Result 1145 states and 3146 transitions. [2018-09-30 23:06:40,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:06:40,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:06:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:40,750 INFO L225 Difference]: With dead ends: 1145 [2018-09-30 23:06:40,750 INFO L226 Difference]: Without dead ends: 812 [2018-09-30 23:06:40,751 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-09-30 23:06:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-09-30 23:06:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 450. [2018-09-30 23:06:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-09-30 23:06:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1432 transitions. [2018-09-30 23:06:40,818 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1432 transitions. Word has length 8 [2018-09-30 23:06:40,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:40,818 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1432 transitions. [2018-09-30 23:06:40,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:40,818 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1432 transitions. [2018-09-30 23:06:40,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:06:40,819 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:40,819 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:40,820 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:40,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:40,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595078, now seen corresponding path program 1 times [2018-09-30 23:06:40,821 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:40,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:40,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:40,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:40,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:40,917 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:40,917 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:06:40,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:40,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:40,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:40,919 INFO L87 Difference]: Start difference. First operand 450 states and 1432 transitions. Second operand 8 states. [2018-09-30 23:06:43,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:43,140 INFO L93 Difference]: Finished difference Result 877 states and 2260 transitions. [2018-09-30 23:06:43,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 23:06:43,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:06:43,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:43,146 INFO L225 Difference]: With dead ends: 877 [2018-09-30 23:06:43,146 INFO L226 Difference]: Without dead ends: 871 [2018-09-30 23:06:43,147 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-09-30 23:06:43,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-09-30 23:06:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 478. [2018-09-30 23:06:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-09-30 23:06:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1531 transitions. [2018-09-30 23:06:43,236 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1531 transitions. Word has length 8 [2018-09-30 23:06:43,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:43,237 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 1531 transitions. [2018-09-30 23:06:43,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1531 transitions. [2018-09-30 23:06:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:06:43,238 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:43,238 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:43,239 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:43,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:43,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064444, now seen corresponding path program 1 times [2018-09-30 23:06:43,240 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:43,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:43,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:43,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:43,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:43,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-09-30 23:06:43,382 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:43,382 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:06:43,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:43,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:43,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:43,384 INFO L87 Difference]: Start difference. First operand 478 states and 1531 transitions. Second operand 8 states. [2018-09-30 23:06:45,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:45,366 INFO L93 Difference]: Finished difference Result 1049 states and 2854 transitions. [2018-09-30 23:06:45,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 23:06:45,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:06:45,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:45,371 INFO L225 Difference]: With dead ends: 1049 [2018-09-30 23:06:45,371 INFO L226 Difference]: Without dead ends: 818 [2018-09-30 23:06:45,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-30 23:06:45,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-09-30 23:06:45,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 524. [2018-09-30 23:06:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-09-30 23:06:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1684 transitions. [2018-09-30 23:06:45,474 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1684 transitions. Word has length 8 [2018-09-30 23:06:45,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:45,474 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 1684 transitions. [2018-09-30 23:06:45,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:45,475 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1684 transitions. [2018-09-30 23:06:45,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:06:45,476 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:45,476 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:45,477 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:45,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:45,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064441, now seen corresponding path program 1 times [2018-09-30 23:06:45,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:45,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:45,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:45,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:45,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:45,647 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:45,647 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:06:45,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:45,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:45,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:45,648 INFO L87 Difference]: Start difference. First operand 524 states and 1684 transitions. Second operand 8 states. [2018-09-30 23:06:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:47,168 INFO L93 Difference]: Finished difference Result 733 states and 1997 transitions. [2018-09-30 23:06:47,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 23:06:47,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:06:47,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:47,175 INFO L225 Difference]: With dead ends: 733 [2018-09-30 23:06:47,176 INFO L226 Difference]: Without dead ends: 727 [2018-09-30 23:06:47,176 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-09-30 23:06:47,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-09-30 23:06:47,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 530. [2018-09-30 23:06:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-09-30 23:06:47,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1690 transitions. [2018-09-30 23:06:47,303 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1690 transitions. Word has length 8 [2018-09-30 23:06:47,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:47,303 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1690 transitions. [2018-09-30 23:06:47,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:47,303 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1690 transitions. [2018-09-30 23:06:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:06:47,305 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:47,305 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:47,306 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:47,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:47,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656691, now seen corresponding path program 1 times [2018-09-30 23:06:47,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:47,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:47,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:47,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:47,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:47,687 WARN L178 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-09-30 23:06:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:47,720 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:47,721 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:06:47,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:47,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:47,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:47,722 INFO L87 Difference]: Start difference. First operand 530 states and 1690 transitions. Second operand 8 states. [2018-09-30 23:06:50,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:50,898 INFO L93 Difference]: Finished difference Result 1329 states and 3609 transitions. [2018-09-30 23:06:50,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 23:06:50,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:06:50,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:50,908 INFO L225 Difference]: With dead ends: 1329 [2018-09-30 23:06:50,909 INFO L226 Difference]: Without dead ends: 1323 [2018-09-30 23:06:50,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-09-30 23:06:50,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-09-30 23:06:51,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 626. [2018-09-30 23:06:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-09-30 23:06:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 2087 transitions. [2018-09-30 23:06:51,083 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 2087 transitions. Word has length 8 [2018-09-30 23:06:51,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:51,083 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 2087 transitions. [2018-09-30 23:06:51,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:51,083 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 2087 transitions. [2018-09-30 23:06:51,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:06:51,084 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:51,084 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:51,085 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:51,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:51,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656688, now seen corresponding path program 1 times [2018-09-30 23:06:51,086 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:51,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:51,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:51,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:51,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:51,433 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:51,433 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:06:51,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:51,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:51,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:51,436 INFO L87 Difference]: Start difference. First operand 626 states and 2087 transitions. Second operand 8 states. [2018-09-30 23:06:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:53,791 INFO L93 Difference]: Finished difference Result 1268 states and 3539 transitions. [2018-09-30 23:06:53,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 23:06:53,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:06:53,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:53,798 INFO L225 Difference]: With dead ends: 1268 [2018-09-30 23:06:53,798 INFO L226 Difference]: Without dead ends: 1262 [2018-09-30 23:06:53,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-09-30 23:06:53,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-09-30 23:06:53,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 618. [2018-09-30 23:06:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-09-30 23:06:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2056 transitions. [2018-09-30 23:06:53,962 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2056 transitions. Word has length 8 [2018-09-30 23:06:53,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:53,962 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 2056 transitions. [2018-09-30 23:06:53,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:53,962 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2056 transitions. [2018-09-30 23:06:53,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:06:53,963 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:53,964 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:53,964 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:53,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:53,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285639, now seen corresponding path program 1 times [2018-09-30 23:06:53,965 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:53,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:53,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:53,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:53,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:54,061 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:54,061 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:06:54,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:54,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:54,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:54,062 INFO L87 Difference]: Start difference. First operand 618 states and 2056 transitions. Second operand 8 states. [2018-09-30 23:06:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:56,503 INFO L93 Difference]: Finished difference Result 1367 states and 3876 transitions. [2018-09-30 23:06:56,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 23:06:56,504 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:06:56,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:56,511 INFO L225 Difference]: With dead ends: 1367 [2018-09-30 23:06:56,512 INFO L226 Difference]: Without dead ends: 1361 [2018-09-30 23:06:56,513 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-09-30 23:06:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-09-30 23:06:56,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 671. [2018-09-30 23:06:56,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-09-30 23:06:56,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2249 transitions. [2018-09-30 23:06:56,681 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2249 transitions. Word has length 8 [2018-09-30 23:06:56,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:56,681 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 2249 transitions. [2018-09-30 23:06:56,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:56,681 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2249 transitions. [2018-09-30 23:06:56,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:06:56,682 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:56,683 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:56,683 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:06:56,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:56,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285636, now seen corresponding path program 1 times [2018-09-30 23:06:56,684 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:56,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:56,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:56,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:56,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:56,798 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:56,798 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:06:56,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:56,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:56,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:56,799 INFO L87 Difference]: Start difference. First operand 671 states and 2249 transitions. Second operand 8 states. [2018-09-30 23:06:59,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:59,977 INFO L93 Difference]: Finished difference Result 1373 states and 3787 transitions. [2018-09-30 23:06:59,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 23:06:59,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:06:59,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:59,987 INFO L225 Difference]: With dead ends: 1373 [2018-09-30 23:06:59,987 INFO L226 Difference]: Without dead ends: 1367 [2018-09-30 23:06:59,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2018-09-30 23:06:59,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-09-30 23:07:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 698. [2018-09-30 23:07:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-09-30 23:07:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2344 transitions. [2018-09-30 23:07:00,186 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2344 transitions. Word has length 8 [2018-09-30 23:07:00,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:00,186 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 2344 transitions. [2018-09-30 23:07:00,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:07:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2344 transitions. [2018-09-30 23:07:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:07:00,187 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:00,188 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:00,188 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:00,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:00,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280348, now seen corresponding path program 1 times [2018-09-30 23:07:00,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:00,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:00,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:00,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:00,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:00,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:00,304 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:00,304 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 23:07:00,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:07:00,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:07:00,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:07:00,305 INFO L87 Difference]: Start difference. First operand 698 states and 2344 transitions. Second operand 7 states. [2018-09-30 23:07:02,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:02,357 INFO L93 Difference]: Finished difference Result 1526 states and 4298 transitions. [2018-09-30 23:07:02,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 23:07:02,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 23:07:02,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:02,365 INFO L225 Difference]: With dead ends: 1526 [2018-09-30 23:07:02,366 INFO L226 Difference]: Without dead ends: 1520 [2018-09-30 23:07:02,366 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-09-30 23:07:02,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-09-30 23:07:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 789. [2018-09-30 23:07:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-09-30 23:07:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2673 transitions. [2018-09-30 23:07:02,583 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2673 transitions. Word has length 8 [2018-09-30 23:07:02,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:02,583 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 2673 transitions. [2018-09-30 23:07:02,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:07:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2673 transitions. [2018-09-30 23:07:02,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:07:02,585 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:02,585 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:02,586 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:02,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:02,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280221, now seen corresponding path program 1 times [2018-09-30 23:07:02,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:02,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:02,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:02,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:02,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:02,699 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:02,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 23:07:02,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:07:02,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:07:02,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:07:02,700 INFO L87 Difference]: Start difference. First operand 789 states and 2673 transitions. Second operand 7 states. [2018-09-30 23:07:04,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:04,962 INFO L93 Difference]: Finished difference Result 1548 states and 4356 transitions. [2018-09-30 23:07:04,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:07:04,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 23:07:04,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:04,970 INFO L225 Difference]: With dead ends: 1548 [2018-09-30 23:07:04,970 INFO L226 Difference]: Without dead ends: 1542 [2018-09-30 23:07:04,971 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-09-30 23:07:04,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-09-30 23:07:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 821. [2018-09-30 23:07:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-09-30 23:07:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2801 transitions. [2018-09-30 23:07:05,193 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2801 transitions. Word has length 8 [2018-09-30 23:07:05,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:05,194 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 2801 transitions. [2018-09-30 23:07:05,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:07:05,194 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2801 transitions. [2018-09-30 23:07:05,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:07:05,195 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:05,195 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:05,195 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:05,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:05,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878937, now seen corresponding path program 1 times [2018-09-30 23:07:05,196 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:05,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:05,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:05,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:05,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:05,313 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:05,313 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 23:07:05,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:07:05,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:07:05,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:07:05,315 INFO L87 Difference]: Start difference. First operand 821 states and 2801 transitions. Second operand 7 states. [2018-09-30 23:07:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:07,509 INFO L93 Difference]: Finished difference Result 1575 states and 4539 transitions. [2018-09-30 23:07:07,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 23:07:07,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 23:07:07,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:07,517 INFO L225 Difference]: With dead ends: 1575 [2018-09-30 23:07:07,517 INFO L226 Difference]: Without dead ends: 1569 [2018-09-30 23:07:07,518 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-09-30 23:07:07,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-09-30 23:07:07,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 849. [2018-09-30 23:07:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-09-30 23:07:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2913 transitions. [2018-09-30 23:07:07,763 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2913 transitions. Word has length 8 [2018-09-30 23:07:07,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:07,763 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 2913 transitions. [2018-09-30 23:07:07,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:07:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2913 transitions. [2018-09-30 23:07:07,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:07:07,764 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:07,764 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:07,764 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:07,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:07,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878810, now seen corresponding path program 1 times [2018-09-30 23:07:07,765 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:07,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:07,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:07,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:07,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:07,866 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:07,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 23:07:07,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:07:07,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:07:07,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:07:07,867 INFO L87 Difference]: Start difference. First operand 849 states and 2913 transitions. Second operand 7 states. [2018-09-30 23:07:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:10,125 INFO L93 Difference]: Finished difference Result 1597 states and 4579 transitions. [2018-09-30 23:07:10,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 23:07:10,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 23:07:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:10,136 INFO L225 Difference]: With dead ends: 1597 [2018-09-30 23:07:10,136 INFO L226 Difference]: Without dead ends: 1591 [2018-09-30 23:07:10,137 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-09-30 23:07:10,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-09-30 23:07:10,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 873. [2018-09-30 23:07:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-09-30 23:07:10,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2993 transitions. [2018-09-30 23:07:10,405 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2993 transitions. Word has length 8 [2018-09-30 23:07:10,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:10,405 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 2993 transitions. [2018-09-30 23:07:10,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:07:10,405 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2993 transitions. [2018-09-30 23:07:10,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:07:10,406 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:10,406 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:10,407 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:10,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:10,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288024, now seen corresponding path program 1 times [2018-09-30 23:07:10,408 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:10,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:10,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:10,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:10,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:10,590 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:10,591 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 23:07:10,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:07:10,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:07:10,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:07:10,592 INFO L87 Difference]: Start difference. First operand 873 states and 2993 transitions. Second operand 7 states. [2018-09-30 23:07:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:12,658 INFO L93 Difference]: Finished difference Result 1726 states and 5211 transitions. [2018-09-30 23:07:12,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 23:07:12,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 23:07:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:12,669 INFO L225 Difference]: With dead ends: 1726 [2018-09-30 23:07:12,669 INFO L226 Difference]: Without dead ends: 1720 [2018-09-30 23:07:12,670 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-09-30 23:07:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2018-09-30 23:07:12,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1006. [2018-09-30 23:07:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-09-30 23:07:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3474 transitions. [2018-09-30 23:07:12,964 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3474 transitions. Word has length 8 [2018-09-30 23:07:12,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:12,964 INFO L480 AbstractCegarLoop]: Abstraction has 1006 states and 3474 transitions. [2018-09-30 23:07:12,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:07:12,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3474 transitions. [2018-09-30 23:07:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:07:12,965 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:12,966 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:12,966 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:12,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:12,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288027, now seen corresponding path program 1 times [2018-09-30 23:07:12,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:12,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:12,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:12,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:12,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:13,115 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:13,115 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 23:07:13,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:07:13,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:07:13,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:07:13,117 INFO L87 Difference]: Start difference. First operand 1006 states and 3474 transitions. Second operand 7 states. [2018-09-30 23:07:15,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:15,675 INFO L93 Difference]: Finished difference Result 1758 states and 5203 transitions. [2018-09-30 23:07:15,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 23:07:15,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 23:07:15,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:15,683 INFO L225 Difference]: With dead ends: 1758 [2018-09-30 23:07:15,683 INFO L226 Difference]: Without dead ends: 1752 [2018-09-30 23:07:15,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-09-30 23:07:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-09-30 23:07:16,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1011. [2018-09-30 23:07:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-09-30 23:07:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3493 transitions. [2018-09-30 23:07:16,041 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3493 transitions. Word has length 8 [2018-09-30 23:07:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:16,041 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 3493 transitions. [2018-09-30 23:07:16,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:07:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3493 transitions. [2018-09-30 23:07:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:07:16,043 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:16,043 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:16,043 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:16,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:16,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746872, now seen corresponding path program 1 times [2018-09-30 23:07:16,044 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:16,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:16,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:16,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:16,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:16,128 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:16,128 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 23:07:16,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:07:16,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:07:16,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:07:16,129 INFO L87 Difference]: Start difference. First operand 1011 states and 3493 transitions. Second operand 7 states. [2018-09-30 23:07:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:18,991 INFO L93 Difference]: Finished difference Result 1867 states and 5608 transitions. [2018-09-30 23:07:18,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 23:07:18,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 23:07:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:18,999 INFO L225 Difference]: With dead ends: 1867 [2018-09-30 23:07:18,999 INFO L226 Difference]: Without dead ends: 1861 [2018-09-30 23:07:19,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-09-30 23:07:19,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2018-09-30 23:07:19,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1119. [2018-09-30 23:07:19,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-09-30 23:07:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3931 transitions. [2018-09-30 23:07:19,402 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3931 transitions. Word has length 8 [2018-09-30 23:07:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:19,402 INFO L480 AbstractCegarLoop]: Abstraction has 1119 states and 3931 transitions. [2018-09-30 23:07:19,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:07:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3931 transitions. [2018-09-30 23:07:19,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:07:19,404 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:19,404 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:19,405 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:19,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:19,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746875, now seen corresponding path program 1 times [2018-09-30 23:07:19,405 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:19,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:19,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:19,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:19,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:19,660 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-09-30 23:07:19,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:19,695 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:19,695 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 23:07:19,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:07:19,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:07:19,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:07:19,695 INFO L87 Difference]: Start difference. First operand 1119 states and 3931 transitions. Second operand 7 states. [2018-09-30 23:07:22,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:22,630 INFO L93 Difference]: Finished difference Result 1968 states and 5829 transitions. [2018-09-30 23:07:22,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 23:07:22,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 23:07:22,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:22,639 INFO L225 Difference]: With dead ends: 1968 [2018-09-30 23:07:22,639 INFO L226 Difference]: Without dead ends: 1962 [2018-09-30 23:07:22,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-09-30 23:07:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-09-30 23:07:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1111. [2018-09-30 23:07:23,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-09-30 23:07:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3891 transitions. [2018-09-30 23:07:23,127 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3891 transitions. Word has length 8 [2018-09-30 23:07:23,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:23,128 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 3891 transitions. [2018-09-30 23:07:23,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:07:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3891 transitions. [2018-09-30 23:07:23,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:07:23,129 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:23,129 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:23,129 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:23,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:23,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1616407055, now seen corresponding path program 1 times [2018-09-30 23:07:23,129 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:23,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:23,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:23,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:23,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:23,223 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:23,223 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 23:07:23,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:07:23,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:07:23,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:07:23,224 INFO L87 Difference]: Start difference. First operand 1111 states and 3891 transitions. Second operand 7 states. [2018-09-30 23:07:26,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:26,012 INFO L93 Difference]: Finished difference Result 2001 states and 6001 transitions. [2018-09-30 23:07:26,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 23:07:26,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 23:07:26,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:26,018 INFO L225 Difference]: With dead ends: 2001 [2018-09-30 23:07:26,019 INFO L226 Difference]: Without dead ends: 1995 [2018-09-30 23:07:26,020 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-09-30 23:07:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-09-30 23:07:26,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1117. [2018-09-30 23:07:26,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-09-30 23:07:26,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 3909 transitions. [2018-09-30 23:07:26,542 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 3909 transitions. Word has length 8 [2018-09-30 23:07:26,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:26,542 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 3909 transitions. [2018-09-30 23:07:26,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:07:26,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 3909 transitions. [2018-09-30 23:07:26,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:07:26,543 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:26,543 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:26,543 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:26,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:26,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1616406928, now seen corresponding path program 1 times [2018-09-30 23:07:26,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:26,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:26,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:26,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:26,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:26,661 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:26,661 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 23:07:26,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:07:26,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:07:26,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:07:26,663 INFO L87 Difference]: Start difference. First operand 1117 states and 3909 transitions. Second operand 7 states. [2018-09-30 23:07:29,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:29,091 INFO L93 Difference]: Finished difference Result 1708 states and 5233 transitions. [2018-09-30 23:07:29,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 23:07:29,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 23:07:29,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:29,099 INFO L225 Difference]: With dead ends: 1708 [2018-09-30 23:07:29,099 INFO L226 Difference]: Without dead ends: 1702 [2018-09-30 23:07:29,100 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-09-30 23:07:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-09-30 23:07:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1210. [2018-09-30 23:07:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2018-09-30 23:07:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4307 transitions. [2018-09-30 23:07:29,760 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 4307 transitions. Word has length 8 [2018-09-30 23:07:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:29,760 INFO L480 AbstractCegarLoop]: Abstraction has 1210 states and 4307 transitions. [2018-09-30 23:07:29,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:07:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 4307 transitions. [2018-09-30 23:07:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:07:29,762 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:29,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:29,762 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:29,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:29,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256941, now seen corresponding path program 1 times [2018-09-30 23:07:29,763 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:29,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:29,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:29,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:29,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:30,339 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-09-30 23:07:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:30,485 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:30,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 23:07:30,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:07:30,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:07:30,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:07:30,486 INFO L87 Difference]: Start difference. First operand 1210 states and 4307 transitions. Second operand 7 states. [2018-09-30 23:07:33,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:33,865 INFO L93 Difference]: Finished difference Result 2402 states and 7321 transitions. [2018-09-30 23:07:33,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:07:33,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 23:07:33,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:33,871 INFO L225 Difference]: With dead ends: 2402 [2018-09-30 23:07:33,872 INFO L226 Difference]: Without dead ends: 2396 [2018-09-30 23:07:33,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-09-30 23:07:33,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-09-30 23:07:34,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1341. [2018-09-30 23:07:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-09-30 23:07:34,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4862 transitions. [2018-09-30 23:07:34,474 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4862 transitions. Word has length 8 [2018-09-30 23:07:34,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:34,474 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4862 transitions. [2018-09-30 23:07:34,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:07:34,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4862 transitions. [2018-09-30 23:07:34,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:07:34,476 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:34,476 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:34,476 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:34,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:34,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256944, now seen corresponding path program 1 times [2018-09-30 23:07:34,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:34,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:34,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:34,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:34,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:34,594 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:34,594 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 23:07:34,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 23:07:34,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 23:07:34,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:07:34,595 INFO L87 Difference]: Start difference. First operand 1341 states and 4862 transitions. Second operand 7 states. [2018-09-30 23:07:37,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:37,701 INFO L93 Difference]: Finished difference Result 2274 states and 6934 transitions. [2018-09-30 23:07:37,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 23:07:37,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 23:07:37,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:37,705 INFO L225 Difference]: With dead ends: 2274 [2018-09-30 23:07:37,706 INFO L226 Difference]: Without dead ends: 2268 [2018-09-30 23:07:37,706 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-09-30 23:07:37,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2018-09-30 23:07:38,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1337. [2018-09-30 23:07:38,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-09-30 23:07:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 4840 transitions. [2018-09-30 23:07:38,319 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 4840 transitions. Word has length 8 [2018-09-30 23:07:38,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:38,319 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 4840 transitions. [2018-09-30 23:07:38,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 23:07:38,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 4840 transitions. [2018-09-30 23:07:38,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:07:38,320 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:38,320 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-30 23:07:38,320 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:38,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:38,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1621267991, now seen corresponding path program 1 times [2018-09-30 23:07:38,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:38,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:38,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:38,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:38,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:38,385 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:38,385 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:07:38,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 23:07:38,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 23:07:38,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:07:38,386 INFO L87 Difference]: Start difference. First operand 1337 states and 4840 transitions. Second operand 4 states. [2018-09-30 23:07:39,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:39,356 INFO L93 Difference]: Finished difference Result 2170 states and 7637 transitions. [2018-09-30 23:07:39,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 23:07:39,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-30 23:07:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:39,359 INFO L225 Difference]: With dead ends: 2170 [2018-09-30 23:07:39,359 INFO L226 Difference]: Without dead ends: 1253 [2018-09-30 23:07:39,360 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-09-30 23:07:39,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-09-30 23:07:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1080. [2018-09-30 23:07:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-09-30 23:07:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3769 transitions. [2018-09-30 23:07:39,917 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3769 transitions. Word has length 8 [2018-09-30 23:07:39,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:39,918 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 3769 transitions. [2018-09-30 23:07:39,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 23:07:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3769 transitions. [2018-09-30 23:07:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:07:39,919 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:39,919 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:39,919 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:39,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:39,920 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283460, now seen corresponding path program 1 times [2018-09-30 23:07:39,920 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:39,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:39,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:39,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:39,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:40,060 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:40,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:07:40,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:07:40,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:07:40,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:07:40,061 INFO L87 Difference]: Start difference. First operand 1080 states and 3769 transitions. Second operand 8 states. [2018-09-30 23:07:43,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:43,779 INFO L93 Difference]: Finished difference Result 2095 states and 6316 transitions. [2018-09-30 23:07:43,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 23:07:43,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:07:43,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:43,784 INFO L225 Difference]: With dead ends: 2095 [2018-09-30 23:07:43,784 INFO L226 Difference]: Without dead ends: 2093 [2018-09-30 23:07:43,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-09-30 23:07:43,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-09-30 23:07:44,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1161. [2018-09-30 23:07:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2018-09-30 23:07:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 4123 transitions. [2018-09-30 23:07:44,334 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 4123 transitions. Word has length 8 [2018-09-30 23:07:44,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:44,334 INFO L480 AbstractCegarLoop]: Abstraction has 1161 states and 4123 transitions. [2018-09-30 23:07:44,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:07:44,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 4123 transitions. [2018-09-30 23:07:44,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:07:44,335 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:44,336 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:44,336 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:44,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:44,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283333, now seen corresponding path program 1 times [2018-09-30 23:07:44,336 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:44,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:44,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:44,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:44,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:44,606 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:44,606 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:07:44,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:07:44,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:07:44,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:07:44,607 INFO L87 Difference]: Start difference. First operand 1161 states and 4123 transitions. Second operand 8 states. [2018-09-30 23:07:48,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:48,320 INFO L93 Difference]: Finished difference Result 1994 states and 5988 transitions. [2018-09-30 23:07:48,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:07:48,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:07:48,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:48,325 INFO L225 Difference]: With dead ends: 1994 [2018-09-30 23:07:48,325 INFO L226 Difference]: Without dead ends: 1988 [2018-09-30 23:07:48,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:07:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-09-30 23:07:48,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1152. [2018-09-30 23:07:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-09-30 23:07:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 4099 transitions. [2018-09-30 23:07:48,900 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 4099 transitions. Word has length 8 [2018-09-30 23:07:48,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:48,900 INFO L480 AbstractCegarLoop]: Abstraction has 1152 states and 4099 transitions. [2018-09-30 23:07:48,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:07:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 4099 transitions. [2018-09-30 23:07:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:07:48,902 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:48,902 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:48,902 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:48,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:48,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1867882049, now seen corresponding path program 1 times [2018-09-30 23:07:48,903 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:48,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:48,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:48,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:48,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:49,060 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:49,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:07:49,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:07:49,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:07:49,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:07:49,060 INFO L87 Difference]: Start difference. First operand 1152 states and 4099 transitions. Second operand 8 states. [2018-09-30 23:07:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:53,350 INFO L93 Difference]: Finished difference Result 2160 states and 6516 transitions. [2018-09-30 23:07:53,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:07:53,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:07:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:53,354 INFO L225 Difference]: With dead ends: 2160 [2018-09-30 23:07:53,355 INFO L226 Difference]: Without dead ends: 2154 [2018-09-30 23:07:53,356 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-09-30 23:07:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2018-09-30 23:07:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1174. [2018-09-30 23:07:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-09-30 23:07:53,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4164 transitions. [2018-09-30 23:07:53,990 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 4164 transitions. Word has length 8 [2018-09-30 23:07:53,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:53,990 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 4164 transitions. [2018-09-30 23:07:53,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:07:53,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 4164 transitions. [2018-09-30 23:07:53,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:07:53,991 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:53,991 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:07:53,991 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:53,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:53,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1867881922, now seen corresponding path program 1 times [2018-09-30 23:07:53,992 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:53,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:53,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:53,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:53,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:54,274 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-09-30 23:07:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:54,323 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:54,323 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:07:54,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:07:54,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:07:54,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:07:54,324 INFO L87 Difference]: Start difference. First operand 1174 states and 4164 transitions. Second operand 8 states. [2018-09-30 23:07:58,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:07:58,555 INFO L93 Difference]: Finished difference Result 2094 states and 6271 transitions. [2018-09-30 23:07:58,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:07:58,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:07:58,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:07:58,559 INFO L225 Difference]: With dead ends: 2094 [2018-09-30 23:07:58,559 INFO L226 Difference]: Without dead ends: 2088 [2018-09-30 23:07:58,560 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-09-30 23:07:58,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2018-09-30 23:07:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1153. [2018-09-30 23:07:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-09-30 23:07:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 4095 transitions. [2018-09-30 23:07:59,210 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 4095 transitions. Word has length 8 [2018-09-30 23:07:59,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:07:59,210 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 4095 transitions. [2018-09-30 23:07:59,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:07:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 4095 transitions. [2018-09-30 23:07:59,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:07:59,211 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:07:59,211 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-30 23:07:59,211 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:07:59,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:07:59,211 INFO L82 PathProgramCache]: Analyzing trace with hash -896988374, now seen corresponding path program 1 times [2018-09-30 23:07:59,212 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:07:59,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:07:59,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:59,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:07:59,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:07:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:07:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:07:59,248 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:07:59,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:07:59,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 23:07:59,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 23:07:59,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:07:59,249 INFO L87 Difference]: Start difference. First operand 1153 states and 4095 transitions. Second operand 4 states. [2018-09-30 23:08:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:00,245 INFO L93 Difference]: Finished difference Result 1929 states and 6604 transitions. [2018-09-30 23:08:00,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 23:08:00,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-30 23:08:00,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:00,248 INFO L225 Difference]: With dead ends: 1929 [2018-09-30 23:08:00,248 INFO L226 Difference]: Without dead ends: 1400 [2018-09-30 23:08:00,250 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-09-30 23:08:00,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2018-09-30 23:08:00,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1083. [2018-09-30 23:08:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2018-09-30 23:08:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3765 transitions. [2018-09-30 23:08:00,969 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 3765 transitions. Word has length 8 [2018-09-30 23:08:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:00,969 INFO L480 AbstractCegarLoop]: Abstraction has 1083 states and 3765 transitions. [2018-09-30 23:08:00,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 23:08:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 3765 transitions. [2018-09-30 23:08:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:08:00,970 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:00,970 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:00,970 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:00,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:00,971 INFO L82 PathProgramCache]: Analyzing trace with hash -896379114, now seen corresponding path program 1 times [2018-09-30 23:08:00,971 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:00,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:00,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:00,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:00,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:01,077 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:08:01,077 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:08:01,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:08:01,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:08:01,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:08:01,079 INFO L87 Difference]: Start difference. First operand 1083 states and 3765 transitions. Second operand 8 states. [2018-09-30 23:08:04,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:04,792 INFO L93 Difference]: Finished difference Result 2276 states and 6948 transitions. [2018-09-30 23:08:04,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 23:08:04,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:08:04,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:04,796 INFO L225 Difference]: With dead ends: 2276 [2018-09-30 23:08:04,796 INFO L226 Difference]: Without dead ends: 2270 [2018-09-30 23:08:04,797 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-09-30 23:08:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2018-09-30 23:08:05,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1266. [2018-09-30 23:08:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2018-09-30 23:08:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4418 transitions. [2018-09-30 23:08:05,557 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 4418 transitions. Word has length 8 [2018-09-30 23:08:05,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:05,558 INFO L480 AbstractCegarLoop]: Abstraction has 1266 states and 4418 transitions. [2018-09-30 23:08:05,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:08:05,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 4418 transitions. [2018-09-30 23:08:05,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:08:05,559 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:05,559 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:05,559 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:05,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:05,560 INFO L82 PathProgramCache]: Analyzing trace with hash -896379111, now seen corresponding path program 1 times [2018-09-30 23:08:05,560 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:05,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:05,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:05,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:05,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:05,649 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:08:05,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:08:05,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:08:05,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:08:05,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:08:05,651 INFO L87 Difference]: Start difference. First operand 1266 states and 4418 transitions. Second operand 8 states. [2018-09-30 23:08:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:09,817 INFO L93 Difference]: Finished difference Result 2425 states and 7363 transitions. [2018-09-30 23:08:09,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:08:09,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:08:09,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:09,822 INFO L225 Difference]: With dead ends: 2425 [2018-09-30 23:08:09,822 INFO L226 Difference]: Without dead ends: 2419 [2018-09-30 23:08:09,822 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-09-30 23:08:09,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2018-09-30 23:08:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1373. [2018-09-30 23:08:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2018-09-30 23:08:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 4822 transitions. [2018-09-30 23:08:10,834 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 4822 transitions. Word has length 8 [2018-09-30 23:08:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:10,834 INFO L480 AbstractCegarLoop]: Abstraction has 1373 states and 4822 transitions. [2018-09-30 23:08:10,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:08:10,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 4822 transitions. [2018-09-30 23:08:10,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:08:10,836 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:10,836 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:10,836 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:10,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:10,837 INFO L82 PathProgramCache]: Analyzing trace with hash -881085998, now seen corresponding path program 1 times [2018-09-30 23:08:10,837 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:10,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:10,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:10,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:10,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:10,930 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:08:10,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:08:10,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:08:10,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:08:10,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:08:10,931 INFO L87 Difference]: Start difference. First operand 1373 states and 4822 transitions. Second operand 8 states. [2018-09-30 23:08:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:15,490 INFO L93 Difference]: Finished difference Result 2278 states and 6952 transitions. [2018-09-30 23:08:15,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 23:08:15,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:08:15,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:15,494 INFO L225 Difference]: With dead ends: 2278 [2018-09-30 23:08:15,495 INFO L226 Difference]: Without dead ends: 2272 [2018-09-30 23:08:15,495 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-09-30 23:08:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2018-09-30 23:08:16,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1421. [2018-09-30 23:08:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2018-09-30 23:08:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 4963 transitions. [2018-09-30 23:08:16,511 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 4963 transitions. Word has length 8 [2018-09-30 23:08:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:16,511 INFO L480 AbstractCegarLoop]: Abstraction has 1421 states and 4963 transitions. [2018-09-30 23:08:16,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:08:16,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 4963 transitions. [2018-09-30 23:08:16,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:08:16,512 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:16,512 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:16,512 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:16,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:16,512 INFO L82 PathProgramCache]: Analyzing trace with hash -881086125, now seen corresponding path program 1 times [2018-09-30 23:08:16,513 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:16,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:16,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:16,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:16,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:16,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:16,601 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:08:16,601 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:08:16,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:08:16,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:08:16,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:08:16,602 INFO L87 Difference]: Start difference. First operand 1421 states and 4963 transitions. Second operand 8 states. [2018-09-30 23:08:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:20,838 INFO L93 Difference]: Finished difference Result 2233 states and 6848 transitions. [2018-09-30 23:08:20,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 23:08:20,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:08:20,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:20,843 INFO L225 Difference]: With dead ends: 2233 [2018-09-30 23:08:20,844 INFO L226 Difference]: Without dead ends: 2227 [2018-09-30 23:08:20,844 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-09-30 23:08:20,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2018-09-30 23:08:21,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1411. [2018-09-30 23:08:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-09-30 23:08:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 4926 transitions. [2018-09-30 23:08:21,804 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 4926 transitions. Word has length 8 [2018-09-30 23:08:21,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:21,804 INFO L480 AbstractCegarLoop]: Abstraction has 1411 states and 4926 transitions. [2018-09-30 23:08:21,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:08:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 4926 transitions. [2018-09-30 23:08:21,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:08:21,805 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:21,805 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:21,805 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:21,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:21,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099334, now seen corresponding path program 1 times [2018-09-30 23:08:21,805 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:21,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:21,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:21,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:21,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:22,047 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2018-09-30 23:08:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:22,125 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:08:22,126 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:08:22,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:08:22,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:08:22,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:08:22,127 INFO L87 Difference]: Start difference. First operand 1411 states and 4926 transitions. Second operand 8 states. [2018-09-30 23:08:26,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:26,793 INFO L93 Difference]: Finished difference Result 2558 states and 7836 transitions. [2018-09-30 23:08:26,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 23:08:26,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:08:26,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:26,798 INFO L225 Difference]: With dead ends: 2558 [2018-09-30 23:08:26,799 INFO L226 Difference]: Without dead ends: 2552 [2018-09-30 23:08:26,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-09-30 23:08:26,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-09-30 23:08:27,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1471. [2018-09-30 23:08:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2018-09-30 23:08:27,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 5183 transitions. [2018-09-30 23:08:27,889 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 5183 transitions. Word has length 8 [2018-09-30 23:08:27,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:27,889 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 5183 transitions. [2018-09-30 23:08:27,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:08:27,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 5183 transitions. [2018-09-30 23:08:27,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:08:27,891 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:27,891 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:27,891 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:27,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:27,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099337, now seen corresponding path program 1 times [2018-09-30 23:08:27,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:27,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:27,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:27,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:27,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:28,018 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:08:28,019 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:08:28,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:08:28,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:08:28,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:08:28,020 INFO L87 Difference]: Start difference. First operand 1471 states and 5183 transitions. Second operand 8 states. [2018-09-30 23:08:32,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:32,927 INFO L93 Difference]: Finished difference Result 2703 states and 8278 transitions. [2018-09-30 23:08:32,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:08:32,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:08:32,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:32,933 INFO L225 Difference]: With dead ends: 2703 [2018-09-30 23:08:32,933 INFO L226 Difference]: Without dead ends: 2697 [2018-09-30 23:08:32,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:08:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2018-09-30 23:08:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1480. [2018-09-30 23:08:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-09-30 23:08:34,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5200 transitions. [2018-09-30 23:08:34,057 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5200 transitions. Word has length 8 [2018-09-30 23:08:34,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:34,057 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5200 transitions. [2018-09-30 23:08:34,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:08:34,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5200 transitions. [2018-09-30 23:08:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:08:34,058 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:34,058 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:34,058 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:34,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:34,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629971, now seen corresponding path program 1 times [2018-09-30 23:08:34,059 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:34,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:34,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:34,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:34,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:34,192 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:08:34,192 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:08:34,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:08:34,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:08:34,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:08:34,193 INFO L87 Difference]: Start difference. First operand 1480 states and 5200 transitions. Second operand 8 states. [2018-09-30 23:08:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:39,392 INFO L93 Difference]: Finished difference Result 2674 states and 8171 transitions. [2018-09-30 23:08:39,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:08:39,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:08:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:39,399 INFO L225 Difference]: With dead ends: 2674 [2018-09-30 23:08:39,400 INFO L226 Difference]: Without dead ends: 2668 [2018-09-30 23:08:39,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:08:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2018-09-30 23:08:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 1480. [2018-09-30 23:08:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-09-30 23:08:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5196 transitions. [2018-09-30 23:08:40,628 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5196 transitions. Word has length 8 [2018-09-30 23:08:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:40,629 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5196 transitions. [2018-09-30 23:08:40,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:08:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5196 transitions. [2018-09-30 23:08:40,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 23:08:40,630 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:40,630 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:40,630 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:40,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:40,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629974, now seen corresponding path program 1 times [2018-09-30 23:08:40,630 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:40,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:40,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:40,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:40,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:40,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:40,817 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:08:40,817 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:08:40,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:08:40,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:08:40,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:08:40,818 INFO L87 Difference]: Start difference. First operand 1480 states and 5196 transitions. Second operand 8 states. [2018-09-30 23:08:46,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:46,206 INFO L93 Difference]: Finished difference Result 2722 states and 8299 transitions. [2018-09-30 23:08:46,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 23:08:46,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 23:08:46,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:46,211 INFO L225 Difference]: With dead ends: 2722 [2018-09-30 23:08:46,211 INFO L226 Difference]: Without dead ends: 2716 [2018-09-30 23:08:46,212 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-09-30 23:08:46,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2018-09-30 23:08:47,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 1462. [2018-09-30 23:08:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2018-09-30 23:08:47,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 5124 transitions. [2018-09-30 23:08:47,343 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 5124 transitions. Word has length 8 [2018-09-30 23:08:47,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:47,343 INFO L480 AbstractCegarLoop]: Abstraction has 1462 states and 5124 transitions. [2018-09-30 23:08:47,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:08:47,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 5124 transitions. [2018-09-30 23:08:47,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:08:47,344 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:47,344 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:47,344 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:47,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:47,345 INFO L82 PathProgramCache]: Analyzing trace with hash 278041308, now seen corresponding path program 1 times [2018-09-30 23:08:47,345 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:47,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:47,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:47,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:47,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:08:47,658 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:08:47,658 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:08:47,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:08:47,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:08:47,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:08:47,659 INFO L87 Difference]: Start difference. First operand 1462 states and 5124 transitions. Second operand 8 states. [2018-09-30 23:08:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:52,640 INFO L93 Difference]: Finished difference Result 2962 states and 9218 transitions. [2018-09-30 23:08:52,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 23:08:52,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 23:08:52,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:52,647 INFO L225 Difference]: With dead ends: 2962 [2018-09-30 23:08:52,647 INFO L226 Difference]: Without dead ends: 2956 [2018-09-30 23:08:52,648 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-09-30 23:08:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2018-09-30 23:08:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1776. [2018-09-30 23:08:54,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-09-30 23:08:54,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 6236 transitions. [2018-09-30 23:08:54,190 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 6236 transitions. Word has length 9 [2018-09-30 23:08:54,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:08:54,191 INFO L480 AbstractCegarLoop]: Abstraction has 1776 states and 6236 transitions. [2018-09-30 23:08:54,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:08:54,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 6236 transitions. [2018-09-30 23:08:54,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:08:54,192 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:08:54,192 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:08:54,193 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:08:54,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:08:54,193 INFO L82 PathProgramCache]: Analyzing trace with hash 278041683, now seen corresponding path program 1 times [2018-09-30 23:08:54,193 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:08:54,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:08:54,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:54,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:08:54,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:08:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:08:54,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-09-30 23:08:54,308 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:08:54,308 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:08:54,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:08:54,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:08:54,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:08:54,308 INFO L87 Difference]: Start difference. First operand 1776 states and 6236 transitions. Second operand 8 states. [2018-09-30 23:08:59,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:08:59,448 INFO L93 Difference]: Finished difference Result 2948 states and 9162 transitions. [2018-09-30 23:08:59,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 23:08:59,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 23:08:59,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:08:59,455 INFO L225 Difference]: With dead ends: 2948 [2018-09-30 23:08:59,455 INFO L226 Difference]: Without dead ends: 2942 [2018-09-30 23:08:59,456 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-09-30 23:08:59,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2018-09-30 23:09:00,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1772. [2018-09-30 23:09:00,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-09-30 23:09:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 6220 transitions. [2018-09-30 23:09:00,957 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 6220 transitions. Word has length 9 [2018-09-30 23:09:00,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:09:00,957 INFO L480 AbstractCegarLoop]: Abstraction has 1772 states and 6220 transitions. [2018-09-30 23:09:00,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:09:00,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 6220 transitions. [2018-09-30 23:09:00,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:09:00,959 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:09:00,959 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:09:00,959 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:09:00,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:09:00,959 INFO L82 PathProgramCache]: Analyzing trace with hash 541105076, now seen corresponding path program 1 times [2018-09-30 23:09:00,959 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:09:00,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:09:00,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:00,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:00,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:01,028 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:09:01,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:09:01,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:09:01,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:09:01,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:09:01,030 INFO L87 Difference]: Start difference. First operand 1772 states and 6220 transitions. Second operand 8 states. [2018-09-30 23:09:07,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:09:07,129 INFO L93 Difference]: Finished difference Result 3238 states and 9970 transitions. [2018-09-30 23:09:07,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:09:07,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 23:09:07,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:09:07,136 INFO L225 Difference]: With dead ends: 3238 [2018-09-30 23:09:07,136 INFO L226 Difference]: Without dead ends: 3232 [2018-09-30 23:09:07,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-09-30 23:09:07,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2018-09-30 23:09:08,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1799. [2018-09-30 23:09:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-09-30 23:09:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 6288 transitions. [2018-09-30 23:09:08,711 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 6288 transitions. Word has length 9 [2018-09-30 23:09:08,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:09:08,711 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 6288 transitions. [2018-09-30 23:09:08,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:09:08,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 6288 transitions. [2018-09-30 23:09:08,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:09:08,713 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:09:08,713 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:09:08,713 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:09:08,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:09:08,713 INFO L82 PathProgramCache]: Analyzing trace with hash 541105451, now seen corresponding path program 1 times [2018-09-30 23:09:08,714 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:09:08,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:09:08,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:08,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:08,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:08,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:08,836 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:09:08,836 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:09:08,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:09:08,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:09:08,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:09:08,836 INFO L87 Difference]: Start difference. First operand 1799 states and 6288 transitions. Second operand 8 states. [2018-09-30 23:09:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:09:15,101 INFO L93 Difference]: Finished difference Result 3212 states and 9854 transitions. [2018-09-30 23:09:15,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:09:15,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 23:09:15,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:09:15,106 INFO L225 Difference]: With dead ends: 3212 [2018-09-30 23:09:15,107 INFO L226 Difference]: Without dead ends: 3206 [2018-09-30 23:09:15,107 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-09-30 23:09:15,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2018-09-30 23:09:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 1737. [2018-09-30 23:09:16,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2018-09-30 23:09:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 6062 transitions. [2018-09-30 23:09:16,603 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 6062 transitions. Word has length 9 [2018-09-30 23:09:16,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:09:16,603 INFO L480 AbstractCegarLoop]: Abstraction has 1737 states and 6062 transitions. [2018-09-30 23:09:16,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:09:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 6062 transitions. [2018-09-30 23:09:16,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:09:16,605 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:09:16,605 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:09:16,605 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:09:16,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:09:16,605 INFO L82 PathProgramCache]: Analyzing trace with hash 825189368, now seen corresponding path program 1 times [2018-09-30 23:09:16,605 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:09:16,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:09:16,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:16,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:16,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:16,749 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:09:16,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:09:16,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:09:16,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:09:16,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:09:16,749 INFO L87 Difference]: Start difference. First operand 1737 states and 6062 transitions. Second operand 8 states. [2018-09-30 23:09:22,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:09:22,507 INFO L93 Difference]: Finished difference Result 3315 states and 10043 transitions. [2018-09-30 23:09:22,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 23:09:22,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 23:09:22,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:09:22,512 INFO L225 Difference]: With dead ends: 3315 [2018-09-30 23:09:22,513 INFO L226 Difference]: Without dead ends: 3309 [2018-09-30 23:09:22,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-09-30 23:09:22,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2018-09-30 23:09:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 1985. [2018-09-30 23:09:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2018-09-30 23:09:24,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 6886 transitions. [2018-09-30 23:09:24,165 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 6886 transitions. Word has length 9 [2018-09-30 23:09:24,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:09:24,165 INFO L480 AbstractCegarLoop]: Abstraction has 1985 states and 6886 transitions. [2018-09-30 23:09:24,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:09:24,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 6886 transitions. [2018-09-30 23:09:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:09:24,167 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:09:24,168 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:09:24,168 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:09:24,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:09:24,168 INFO L82 PathProgramCache]: Analyzing trace with hash 825189371, now seen corresponding path program 1 times [2018-09-30 23:09:24,168 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:09:24,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:09:24,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:24,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:24,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:24,278 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:09:24,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:09:24,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:09:24,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:09:24,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:09:24,279 INFO L87 Difference]: Start difference. First operand 1985 states and 6886 transitions. Second operand 8 states. [2018-09-30 23:09:30,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:09:30,786 INFO L93 Difference]: Finished difference Result 3446 states and 10415 transitions. [2018-09-30 23:09:30,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:09:30,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 23:09:30,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:09:30,793 INFO L225 Difference]: With dead ends: 3446 [2018-09-30 23:09:30,793 INFO L226 Difference]: Without dead ends: 3440 [2018-09-30 23:09:30,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:09:30,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2018-09-30 23:09:32,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 1927. [2018-09-30 23:09:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1927 states. [2018-09-30 23:09:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 6663 transitions. [2018-09-30 23:09:32,501 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 6663 transitions. Word has length 9 [2018-09-30 23:09:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:09:32,501 INFO L480 AbstractCegarLoop]: Abstraction has 1927 states and 6663 transitions. [2018-09-30 23:09:32,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:09:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 6663 transitions. [2018-09-30 23:09:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:09:32,502 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:09:32,502 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:09:32,502 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:09:32,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:09:32,503 INFO L82 PathProgramCache]: Analyzing trace with hash 832700792, now seen corresponding path program 1 times [2018-09-30 23:09:32,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:09:32,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:09:32,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:32,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:32,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:33,028 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:09:33,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:09:33,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:09:33,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:09:33,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:09:33,029 INFO L87 Difference]: Start difference. First operand 1927 states and 6663 transitions. Second operand 8 states. [2018-09-30 23:09:38,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:09:38,520 INFO L93 Difference]: Finished difference Result 2832 states and 8631 transitions. [2018-09-30 23:09:38,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 23:09:38,521 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 23:09:38,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:09:38,526 INFO L225 Difference]: With dead ends: 2832 [2018-09-30 23:09:38,526 INFO L226 Difference]: Without dead ends: 2824 [2018-09-30 23:09:38,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:09:38,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2018-09-30 23:09:40,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 1904. [2018-09-30 23:09:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-09-30 23:09:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 6553 transitions. [2018-09-30 23:09:40,351 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 6553 transitions. Word has length 9 [2018-09-30 23:09:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:09:40,352 INFO L480 AbstractCegarLoop]: Abstraction has 1904 states and 6553 transitions. [2018-09-30 23:09:40,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:09:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 6553 transitions. [2018-09-30 23:09:40,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:09:40,353 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:09:40,353 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:09:40,353 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:09:40,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:09:40,354 INFO L82 PathProgramCache]: Analyzing trace with hash -595843680, now seen corresponding path program 1 times [2018-09-30 23:09:40,354 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:09:40,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:09:40,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:40,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:40,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:40,455 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:09:40,455 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:09:40,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:09:40,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:09:40,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:09:40,456 INFO L87 Difference]: Start difference. First operand 1904 states and 6553 transitions. Second operand 9 states. [2018-09-30 23:09:46,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:09:46,447 INFO L93 Difference]: Finished difference Result 3157 states and 9716 transitions. [2018-09-30 23:09:46,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:09:46,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-30 23:09:46,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:09:46,454 INFO L225 Difference]: With dead ends: 3157 [2018-09-30 23:09:46,454 INFO L226 Difference]: Without dead ends: 3151 [2018-09-30 23:09:46,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-09-30 23:09:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2018-09-30 23:09:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 1949. [2018-09-30 23:09:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2018-09-30 23:09:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 6722 transitions. [2018-09-30 23:09:48,316 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 6722 transitions. Word has length 9 [2018-09-30 23:09:48,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:09:48,316 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 6722 transitions. [2018-09-30 23:09:48,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:09:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 6722 transitions. [2018-09-30 23:09:48,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:09:48,318 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:09:48,318 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:09:48,318 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:09:48,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:09:48,318 INFO L82 PathProgramCache]: Analyzing trace with hash -595843677, now seen corresponding path program 1 times [2018-09-30 23:09:48,318 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:09:48,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:09:48,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:48,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:48,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:48,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:48,442 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:09:48,442 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:09:48,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:09:48,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:09:48,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:09:48,443 INFO L87 Difference]: Start difference. First operand 1949 states and 6722 transitions. Second operand 9 states. [2018-09-30 23:09:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:09:56,901 INFO L93 Difference]: Finished difference Result 3822 states and 11523 transitions. [2018-09-30 23:09:56,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 23:09:56,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-30 23:09:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:09:56,908 INFO L225 Difference]: With dead ends: 3822 [2018-09-30 23:09:56,908 INFO L226 Difference]: Without dead ends: 3816 [2018-09-30 23:09:56,910 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-09-30 23:09:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2018-09-30 23:09:58,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 2098. [2018-09-30 23:09:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-09-30 23:09:59,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 7405 transitions. [2018-09-30 23:09:59,002 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 7405 transitions. Word has length 9 [2018-09-30 23:09:59,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:09:59,003 INFO L480 AbstractCegarLoop]: Abstraction has 2098 states and 7405 transitions. [2018-09-30 23:09:59,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:09:59,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 7405 transitions. [2018-09-30 23:09:59,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:09:59,004 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:09:59,004 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:09:59,004 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:09:59,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:09:59,005 INFO L82 PathProgramCache]: Analyzing trace with hash -204435682, now seen corresponding path program 1 times [2018-09-30 23:09:59,005 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:09:59,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:09:59,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:59,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:09:59,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:09:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:09:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:09:59,141 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:09:59,141 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:09:59,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:09:59,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:09:59,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:09:59,142 INFO L87 Difference]: Start difference. First operand 2098 states and 7405 transitions. Second operand 9 states. [2018-09-30 23:10:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:08,309 INFO L93 Difference]: Finished difference Result 4144 states and 12499 transitions. [2018-09-30 23:10:08,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 23:10:08,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-30 23:10:08,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:08,316 INFO L225 Difference]: With dead ends: 4144 [2018-09-30 23:10:08,317 INFO L226 Difference]: Without dead ends: 4138 [2018-09-30 23:10:08,318 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-09-30 23:10:08,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2018-09-30 23:10:10,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 2260. [2018-09-30 23:10:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2018-09-30 23:10:10,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 7995 transitions. [2018-09-30 23:10:10,675 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 7995 transitions. Word has length 9 [2018-09-30 23:10:10,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:10,675 INFO L480 AbstractCegarLoop]: Abstraction has 2260 states and 7995 transitions. [2018-09-30 23:10:10,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:10:10,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 7995 transitions. [2018-09-30 23:10:10,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:10:10,676 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:10,676 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:10,676 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:10,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:10,677 INFO L82 PathProgramCache]: Analyzing trace with hash -204435307, now seen corresponding path program 1 times [2018-09-30 23:10:10,677 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:10,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:10,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:10,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:10,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:10,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:10:10,771 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:10:10,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:10:10,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:10:10,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:10:10,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:10:10,772 INFO L87 Difference]: Start difference. First operand 2260 states and 7995 transitions. Second operand 9 states. [2018-09-30 23:10:17,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:17,977 INFO L93 Difference]: Finished difference Result 3320 states and 10163 transitions. [2018-09-30 23:10:17,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 23:10:17,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-30 23:10:17,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:17,985 INFO L225 Difference]: With dead ends: 3320 [2018-09-30 23:10:17,985 INFO L226 Difference]: Without dead ends: 3314 [2018-09-30 23:10:17,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-09-30 23:10:17,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2018-09-30 23:10:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 2191. [2018-09-30 23:10:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2191 states. [2018-09-30 23:10:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 7721 transitions. [2018-09-30 23:10:20,363 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 7721 transitions. Word has length 9 [2018-09-30 23:10:20,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:20,363 INFO L480 AbstractCegarLoop]: Abstraction has 2191 states and 7721 transitions. [2018-09-30 23:10:20,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:10:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 7721 transitions. [2018-09-30 23:10:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:10:20,365 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:20,365 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:20,365 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:20,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:20,365 INFO L82 PathProgramCache]: Analyzing trace with hash -966522519, now seen corresponding path program 1 times [2018-09-30 23:10:20,365 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:20,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:20,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:20,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:20,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:10:20,476 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:10:20,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:10:20,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:10:20,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:10:20,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:10:20,477 INFO L87 Difference]: Start difference. First operand 2191 states and 7721 transitions. Second operand 8 states. [2018-09-30 23:10:29,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:29,708 INFO L93 Difference]: Finished difference Result 4113 states and 13014 transitions. [2018-09-30 23:10:29,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 23:10:29,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 23:10:29,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:29,717 INFO L225 Difference]: With dead ends: 4113 [2018-09-30 23:10:29,717 INFO L226 Difference]: Without dead ends: 4107 [2018-09-30 23:10:29,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-09-30 23:10:29,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2018-09-30 23:10:32,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 2224. [2018-09-30 23:10:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2018-09-30 23:10:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 7857 transitions. [2018-09-30 23:10:32,121 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 7857 transitions. Word has length 9 [2018-09-30 23:10:32,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:32,122 INFO L480 AbstractCegarLoop]: Abstraction has 2224 states and 7857 transitions. [2018-09-30 23:10:32,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:10:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 7857 transitions. [2018-09-30 23:10:32,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:10:32,123 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:32,123 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:32,123 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:32,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash -966522144, now seen corresponding path program 1 times [2018-09-30 23:10:32,123 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:32,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:32,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:10:32,219 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:10:32,220 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:10:32,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:10:32,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:10:32,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:10:32,221 INFO L87 Difference]: Start difference. First operand 2224 states and 7857 transitions. Second operand 8 states. [2018-09-30 23:10:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:41,980 INFO L93 Difference]: Finished difference Result 4521 states and 14364 transitions. [2018-09-30 23:10:41,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:10:41,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 23:10:41,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:41,988 INFO L225 Difference]: With dead ends: 4521 [2018-09-30 23:10:41,988 INFO L226 Difference]: Without dead ends: 4515 [2018-09-30 23:10:41,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:10:41,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2018-09-30 23:10:44,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 2187. [2018-09-30 23:10:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2187 states. [2018-09-30 23:10:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 7764 transitions. [2018-09-30 23:10:44,448 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 7764 transitions. Word has length 9 [2018-09-30 23:10:44,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:44,449 INFO L480 AbstractCegarLoop]: Abstraction has 2187 states and 7764 transitions. [2018-09-30 23:10:44,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:10:44,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 7764 transitions. [2018-09-30 23:10:44,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:10:44,450 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:44,450 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:44,450 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:44,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:44,451 INFO L82 PathProgramCache]: Analyzing trace with hash -703458751, now seen corresponding path program 1 times [2018-09-30 23:10:44,451 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:44,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:44,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:44,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:44,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:44,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:10:44,583 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:10:44,583 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:10:44,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:10:44,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:10:44,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:10:44,584 INFO L87 Difference]: Start difference. First operand 2187 states and 7764 transitions. Second operand 8 states. [2018-09-30 23:10:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:10:53,960 INFO L93 Difference]: Finished difference Result 3855 states and 12150 transitions. [2018-09-30 23:10:53,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 23:10:53,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 23:10:53,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:10:53,968 INFO L225 Difference]: With dead ends: 3855 [2018-09-30 23:10:53,968 INFO L226 Difference]: Without dead ends: 3849 [2018-09-30 23:10:53,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-09-30 23:10:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2018-09-30 23:10:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 2143. [2018-09-30 23:10:56,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2143 states. [2018-09-30 23:10:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 2143 states and 7583 transitions. [2018-09-30 23:10:56,478 INFO L78 Accepts]: Start accepts. Automaton has 2143 states and 7583 transitions. Word has length 9 [2018-09-30 23:10:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:10:56,478 INFO L480 AbstractCegarLoop]: Abstraction has 2143 states and 7583 transitions. [2018-09-30 23:10:56,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:10:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 7583 transitions. [2018-09-30 23:10:56,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:10:56,479 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:10:56,479 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:10:56,479 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:10:56,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:10:56,479 INFO L82 PathProgramCache]: Analyzing trace with hash -703458376, now seen corresponding path program 1 times [2018-09-30 23:10:56,480 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:10:56,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:10:56,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:56,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:10:56,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:10:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:10:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:10:56,668 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:10:56,668 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:10:56,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:10:56,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:10:56,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:10:56,669 INFO L87 Difference]: Start difference. First operand 2143 states and 7583 transitions. Second operand 8 states. [2018-09-30 23:11:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:11:06,494 INFO L93 Difference]: Finished difference Result 4238 states and 13299 transitions. [2018-09-30 23:11:06,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 23:11:06,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 23:11:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:11:06,504 INFO L225 Difference]: With dead ends: 4238 [2018-09-30 23:11:06,504 INFO L226 Difference]: Without dead ends: 4236 [2018-09-30 23:11:06,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-09-30 23:11:06,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4236 states. [2018-09-30 23:11:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4236 to 2077. [2018-09-30 23:11:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2077 states. [2018-09-30 23:11:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 7307 transitions. [2018-09-30 23:11:08,997 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 7307 transitions. Word has length 9 [2018-09-30 23:11:08,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:11:08,997 INFO L480 AbstractCegarLoop]: Abstraction has 2077 states and 7307 transitions. [2018-09-30 23:11:08,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:11:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 7307 transitions. [2018-09-30 23:11:08,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:11:08,998 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:11:08,998 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:11:08,998 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:11:08,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:11:08,998 INFO L82 PathProgramCache]: Analyzing trace with hash 2069416361, now seen corresponding path program 1 times [2018-09-30 23:11:08,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:11:08,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:11:08,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:08,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:08,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:11:09,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:11:09,129 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:11:09,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:11:09,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:11:09,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:11:09,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:11:09,130 INFO L87 Difference]: Start difference. First operand 2077 states and 7307 transitions. Second operand 8 states. [2018-09-30 23:11:20,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:11:20,706 INFO L93 Difference]: Finished difference Result 4709 states and 14887 transitions. [2018-09-30 23:11:20,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 23:11:20,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 23:11:20,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:11:20,716 INFO L225 Difference]: With dead ends: 4709 [2018-09-30 23:11:20,716 INFO L226 Difference]: Without dead ends: 4703 [2018-09-30 23:11:20,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=346, Unknown=0, NotChecked=0, Total=506 [2018-09-30 23:11:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4703 states. [2018-09-30 23:11:23,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4703 to 2205. [2018-09-30 23:11:23,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2205 states. [2018-09-30 23:11:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 7795 transitions. [2018-09-30 23:11:23,541 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 7795 transitions. Word has length 9 [2018-09-30 23:11:23,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:11:23,541 INFO L480 AbstractCegarLoop]: Abstraction has 2205 states and 7795 transitions. [2018-09-30 23:11:23,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:11:23,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 7795 transitions. [2018-09-30 23:11:23,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:11:23,542 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:11:23,542 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:11:23,543 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:11:23,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:11:23,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2069416736, now seen corresponding path program 1 times [2018-09-30 23:11:23,543 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:11:23,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:11:23,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:23,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:23,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:11:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:11:23,926 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:11:23,927 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:11:23,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:11:23,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:11:23,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:11:23,927 INFO L87 Difference]: Start difference. First operand 2205 states and 7795 transitions. Second operand 8 states. [2018-09-30 23:11:33,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:11:33,810 INFO L93 Difference]: Finished difference Result 4247 states and 13579 transitions. [2018-09-30 23:11:33,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 23:11:33,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 23:11:33,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:11:33,820 INFO L225 Difference]: With dead ends: 4247 [2018-09-30 23:11:33,820 INFO L226 Difference]: Without dead ends: 4241 [2018-09-30 23:11:33,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:11:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4241 states. [2018-09-30 23:11:37,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4241 to 2723. [2018-09-30 23:11:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2018-09-30 23:11:37,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 9843 transitions. [2018-09-30 23:11:37,150 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 9843 transitions. Word has length 9 [2018-09-30 23:11:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:11:37,151 INFO L480 AbstractCegarLoop]: Abstraction has 2723 states and 9843 transitions. [2018-09-30 23:11:37,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:11:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 9843 transitions. [2018-09-30 23:11:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:11:37,152 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:11:37,152 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:11:37,152 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:11:37,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:11:37,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2017829461, now seen corresponding path program 1 times [2018-09-30 23:11:37,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:11:37,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:11:37,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:37,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:37,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:11:37,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:11:37,277 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:11:37,277 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:11:37,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:11:37,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:11:37,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:11:37,277 INFO L87 Difference]: Start difference. First operand 2723 states and 9843 transitions. Second operand 9 states. [2018-09-30 23:11:45,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:11:45,825 INFO L93 Difference]: Finished difference Result 6774 states and 23375 transitions. [2018-09-30 23:11:45,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 23:11:45,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-30 23:11:45,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:11:45,833 INFO L225 Difference]: With dead ends: 6774 [2018-09-30 23:11:45,833 INFO L226 Difference]: Without dead ends: 4052 [2018-09-30 23:11:45,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-09-30 23:11:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4052 states. [2018-09-30 23:11:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4052 to 2719. [2018-09-30 23:11:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2719 states. [2018-09-30 23:11:49,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 9745 transitions. [2018-09-30 23:11:49,267 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 9745 transitions. Word has length 9 [2018-09-30 23:11:49,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:11:49,267 INFO L480 AbstractCegarLoop]: Abstraction has 2719 states and 9745 transitions. [2018-09-30 23:11:49,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:11:49,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 9745 transitions. [2018-09-30 23:11:49,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:11:49,268 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:11:49,268 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:11:49,269 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:11:49,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:11:49,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2017829350, now seen corresponding path program 1 times [2018-09-30 23:11:49,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:11:49,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:11:49,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:49,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:11:49,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:11:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:11:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:11:49,347 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:11:49,347 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:11:49,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:11:49,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:11:49,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:11:49,348 INFO L87 Difference]: Start difference. First operand 2719 states and 9745 transitions. Second operand 9 states. [2018-09-30 23:11:58,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:11:58,727 INFO L93 Difference]: Finished difference Result 3818 states and 12356 transitions. [2018-09-30 23:11:58,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 23:11:58,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-30 23:11:58,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:11:58,734 INFO L225 Difference]: With dead ends: 3818 [2018-09-30 23:11:58,734 INFO L226 Difference]: Without dead ends: 3812 [2018-09-30 23:11:58,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=625, Unknown=0, NotChecked=0, Total=870 [2018-09-30 23:11:58,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3812 states. [2018-09-30 23:12:02,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3812 to 2654. [2018-09-30 23:12:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2654 states. [2018-09-30 23:12:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 9529 transitions. [2018-09-30 23:12:02,093 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 9529 transitions. Word has length 9 [2018-09-30 23:12:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:12:02,093 INFO L480 AbstractCegarLoop]: Abstraction has 2654 states and 9529 transitions. [2018-09-30 23:12:02,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:12:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 9529 transitions. [2018-09-30 23:12:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:12:02,095 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:12:02,095 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:12:02,095 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:12:02,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:12:02,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1544214472, now seen corresponding path program 1 times [2018-09-30 23:12:02,095 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:12:02,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:12:02,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:02,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:12:02,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:12:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:12:02,213 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:12:02,213 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:12:02,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:12:02,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:12:02,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:12:02,214 INFO L87 Difference]: Start difference. First operand 2654 states and 9529 transitions. Second operand 9 states. [2018-09-30 23:12:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:12:11,541 INFO L93 Difference]: Finished difference Result 6017 states and 20262 transitions. [2018-09-30 23:12:11,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 23:12:11,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-30 23:12:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:12:11,549 INFO L225 Difference]: With dead ends: 6017 [2018-09-30 23:12:11,549 INFO L226 Difference]: Without dead ends: 3832 [2018-09-30 23:12:11,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-09-30 23:12:11,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3832 states. [2018-09-30 23:12:14,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3832 to 2609. [2018-09-30 23:12:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2609 states. [2018-09-30 23:12:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 9097 transitions. [2018-09-30 23:12:14,944 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 9097 transitions. Word has length 9 [2018-09-30 23:12:14,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:12:14,944 INFO L480 AbstractCegarLoop]: Abstraction has 2609 states and 9097 transitions. [2018-09-30 23:12:14,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:12:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 9097 transitions. [2018-09-30 23:12:14,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:12:14,945 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:12:14,945 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:12:14,946 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:12:14,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:12:14,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1544214097, now seen corresponding path program 1 times [2018-09-30 23:12:14,946 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:12:14,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:12:14,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:14,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:12:14,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:12:15,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:12:15,052 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:12:15,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 23:12:15,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:12:15,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:12:15,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:12:15,053 INFO L87 Difference]: Start difference. First operand 2609 states and 9097 transitions. Second operand 9 states. [2018-09-30 23:12:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:12:27,036 INFO L93 Difference]: Finished difference Result 4453 states and 13944 transitions. [2018-09-30 23:12:27,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 23:12:27,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-30 23:12:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:12:27,046 INFO L225 Difference]: With dead ends: 4453 [2018-09-30 23:12:27,046 INFO L226 Difference]: Without dead ends: 4447 [2018-09-30 23:12:27,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=625, Unknown=0, NotChecked=0, Total=870 [2018-09-30 23:12:27,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4447 states. [2018-09-30 23:12:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4447 to 2339. [2018-09-30 23:12:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2339 states. [2018-09-30 23:12:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 8091 transitions. [2018-09-30 23:12:30,308 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 8091 transitions. Word has length 9 [2018-09-30 23:12:30,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:12:30,308 INFO L480 AbstractCegarLoop]: Abstraction has 2339 states and 8091 transitions. [2018-09-30 23:12:30,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:12:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 8091 transitions. [2018-09-30 23:12:30,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:12:30,310 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:12:30,310 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:12:30,310 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:12:30,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:12:30,310 INFO L82 PathProgramCache]: Analyzing trace with hash -164665634, now seen corresponding path program 1 times [2018-09-30 23:12:30,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:12:30,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:12:30,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:30,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:12:30,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:12:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:12:30,412 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:12:30,412 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:12:30,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:12:30,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:12:30,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:12:30,413 INFO L87 Difference]: Start difference. First operand 2339 states and 8091 transitions. Second operand 8 states. [2018-09-30 23:12:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:12:40,116 INFO L93 Difference]: Finished difference Result 3691 states and 11650 transitions. [2018-09-30 23:12:40,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 23:12:40,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 23:12:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:12:40,124 INFO L225 Difference]: With dead ends: 3691 [2018-09-30 23:12:40,124 INFO L226 Difference]: Without dead ends: 3689 [2018-09-30 23:12:40,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-09-30 23:12:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2018-09-30 23:12:43,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 2341. [2018-09-30 23:12:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2341 states. [2018-09-30 23:12:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 8100 transitions. [2018-09-30 23:12:43,425 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 8100 transitions. Word has length 9 [2018-09-30 23:12:43,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:12:43,425 INFO L480 AbstractCegarLoop]: Abstraction has 2341 states and 8100 transitions. [2018-09-30 23:12:43,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:12:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 8100 transitions. [2018-09-30 23:12:43,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:12:43,427 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:12:43,427 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:12:43,427 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:12:43,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:12:43,427 INFO L82 PathProgramCache]: Analyzing trace with hash -164665523, now seen corresponding path program 1 times [2018-09-30 23:12:43,427 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:12:43,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:12:43,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:43,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:12:43,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:12:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:12:43,533 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:12:43,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:12:43,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:12:43,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:12:43,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:12:43,534 INFO L87 Difference]: Start difference. First operand 2341 states and 8100 transitions. Second operand 8 states. [2018-09-30 23:12:52,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:12:52,882 INFO L93 Difference]: Finished difference Result 3575 states and 11166 transitions. [2018-09-30 23:12:52,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:12:52,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 23:12:52,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:12:52,889 INFO L225 Difference]: With dead ends: 3575 [2018-09-30 23:12:52,890 INFO L226 Difference]: Without dead ends: 3569 [2018-09-30 23:12:52,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:12:52,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3569 states. [2018-09-30 23:12:56,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3569 to 2282. [2018-09-30 23:12:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2018-09-30 23:12:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 7890 transitions. [2018-09-30 23:12:56,149 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 7890 transitions. Word has length 9 [2018-09-30 23:12:56,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:12:56,150 INFO L480 AbstractCegarLoop]: Abstraction has 2282 states and 7890 transitions. [2018-09-30 23:12:56,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:12:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 7890 transitions. [2018-09-30 23:12:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:12:56,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:12:56,151 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:12:56,151 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:12:56,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:12:56,151 INFO L82 PathProgramCache]: Analyzing trace with hash 105933428, now seen corresponding path program 1 times [2018-09-30 23:12:56,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:12:56,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:12:56,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:56,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:12:56,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:12:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:12:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:12:56,291 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:12:56,291 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:12:56,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:12:56,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:12:56,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:12:56,292 INFO L87 Difference]: Start difference. First operand 2282 states and 7890 transitions. Second operand 8 states. [2018-09-30 23:13:05,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:13:05,538 INFO L93 Difference]: Finished difference Result 3555 states and 11315 transitions. [2018-09-30 23:13:05,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:13:05,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 23:13:05,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:13:05,546 INFO L225 Difference]: With dead ends: 3555 [2018-09-30 23:13:05,546 INFO L226 Difference]: Without dead ends: 3549 [2018-09-30 23:13:05,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:13:05,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3549 states. [2018-09-30 23:13:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3549 to 2245. [2018-09-30 23:13:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2018-09-30 23:13:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 7736 transitions. [2018-09-30 23:13:08,800 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 7736 transitions. Word has length 9 [2018-09-30 23:13:08,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:13:08,800 INFO L480 AbstractCegarLoop]: Abstraction has 2245 states and 7736 transitions. [2018-09-30 23:13:08,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:13:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 7736 transitions. [2018-09-30 23:13:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 23:13:08,802 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:13:08,802 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:13:08,802 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:13:08,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:13:08,802 INFO L82 PathProgramCache]: Analyzing trace with hash 105933539, now seen corresponding path program 1 times [2018-09-30 23:13:08,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:13:08,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:13:08,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:08,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:08,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:13:09,258 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:13:09,258 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 23:13:09,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:13:09,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:13:09,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:13:09,259 INFO L87 Difference]: Start difference. First operand 2245 states and 7736 transitions. Second operand 8 states. [2018-09-30 23:13:11,419 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-30 23:13:18,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:13:18,379 INFO L93 Difference]: Finished difference Result 3393 states and 10634 transitions. [2018-09-30 23:13:18,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 23:13:18,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 23:13:18,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:13:18,385 INFO L225 Difference]: With dead ends: 3393 [2018-09-30 23:13:18,385 INFO L226 Difference]: Without dead ends: 3391 [2018-09-30 23:13:18,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-09-30 23:13:18,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2018-09-30 23:13:21,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 2207. [2018-09-30 23:13:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2018-09-30 23:13:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 7572 transitions. [2018-09-30 23:13:21,667 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 7572 transitions. Word has length 9 [2018-09-30 23:13:21,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:13:21,667 INFO L480 AbstractCegarLoop]: Abstraction has 2207 states and 7572 transitions. [2018-09-30 23:13:21,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:13:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 7572 transitions. [2018-09-30 23:13:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:13:21,668 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:13:21,669 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:13:21,669 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:13:21,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:13:21,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1791280574, now seen corresponding path program 1 times [2018-09-30 23:13:21,669 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:13:21,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:13:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:21,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:21,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:13:21,713 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:13:21,713 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:13:21,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 23:13:21,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 23:13:21,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:13:21,714 INFO L87 Difference]: Start difference. First operand 2207 states and 7572 transitions. Second operand 4 states. [2018-09-30 23:13:24,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:13:24,037 INFO L93 Difference]: Finished difference Result 3105 states and 10535 transitions. [2018-09-30 23:13:24,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 23:13:24,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-09-30 23:13:24,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:13:24,040 INFO L225 Difference]: With dead ends: 3105 [2018-09-30 23:13:24,040 INFO L226 Difference]: Without dead ends: 1193 [2018-09-30 23:13:24,042 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-09-30 23:13:24,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2018-09-30 23:13:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 543. [2018-09-30 23:13:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-09-30 23:13:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1674 transitions. [2018-09-30 23:13:25,218 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1674 transitions. Word has length 11 [2018-09-30 23:13:25,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:13:25,219 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 1674 transitions. [2018-09-30 23:13:25,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 23:13:25,219 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1674 transitions. [2018-09-30 23:13:25,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:13:25,219 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:13:25,219 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:13:25,220 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:13:25,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:13:25,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1790113719, now seen corresponding path program 1 times [2018-09-30 23:13:25,220 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:13:25,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:13:25,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:25,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:25,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:13:25,400 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:13:25,400 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:13:25,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:13:25,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:13:25,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:13:25,401 INFO L87 Difference]: Start difference. First operand 543 states and 1674 transitions. Second operand 10 states. [2018-09-30 23:13:41,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:13:41,495 INFO L93 Difference]: Finished difference Result 3379 states and 8888 transitions. [2018-09-30 23:13:41,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-30 23:13:41,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:13:41,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:13:41,501 INFO L225 Difference]: With dead ends: 3379 [2018-09-30 23:13:41,502 INFO L226 Difference]: Without dead ends: 3182 [2018-09-30 23:13:41,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=527, Invalid=1729, Unknown=0, NotChecked=0, Total=2256 [2018-09-30 23:13:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2018-09-30 23:13:43,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 987. [2018-09-30 23:13:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2018-09-30 23:13:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 3210 transitions. [2018-09-30 23:13:43,803 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 3210 transitions. Word has length 11 [2018-09-30 23:13:43,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:13:43,803 INFO L480 AbstractCegarLoop]: Abstraction has 987 states and 3210 transitions. [2018-09-30 23:13:43,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:13:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 3210 transitions. [2018-09-30 23:13:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:13:43,804 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:13:43,804 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:13:43,805 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:13:43,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:13:43,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1790113722, now seen corresponding path program 1 times [2018-09-30 23:13:43,805 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:13:43,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:13:43,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:43,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:43,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:13:44,356 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:13:44,356 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:13:44,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:13:44,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:13:44,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:13:44,357 INFO L87 Difference]: Start difference. First operand 987 states and 3210 transitions. Second operand 10 states. [2018-09-30 23:13:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:13:57,408 INFO L93 Difference]: Finished difference Result 3217 states and 8817 transitions. [2018-09-30 23:13:57,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 23:13:57,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:13:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:13:57,414 INFO L225 Difference]: With dead ends: 3217 [2018-09-30 23:13:57,414 INFO L226 Difference]: Without dead ends: 2555 [2018-09-30 23:13:57,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2018-09-30 23:13:57,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2018-09-30 23:13:59,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 1088. [2018-09-30 23:13:59,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2018-09-30 23:13:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 3479 transitions. [2018-09-30 23:13:59,801 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 3479 transitions. Word has length 11 [2018-09-30 23:13:59,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:13:59,801 INFO L480 AbstractCegarLoop]: Abstraction has 1088 states and 3479 transitions. [2018-09-30 23:13:59,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:13:59,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 3479 transitions. [2018-09-30 23:13:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:13:59,802 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:13:59,802 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:13:59,802 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:13:59,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:13:59,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1790113725, now seen corresponding path program 1 times [2018-09-30 23:13:59,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:13:59,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:13:59,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:59,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:13:59,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:13:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:13:59,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:13:59,902 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:13:59,902 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:13:59,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:13:59,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:13:59,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:13:59,903 INFO L87 Difference]: Start difference. First operand 1088 states and 3479 transitions. Second operand 10 states. [2018-09-30 23:14:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:14:13,576 INFO L93 Difference]: Finished difference Result 2969 states and 8028 transitions. [2018-09-30 23:14:13,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 23:14:13,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:14:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:14:13,582 INFO L225 Difference]: With dead ends: 2969 [2018-09-30 23:14:13,582 INFO L226 Difference]: Without dead ends: 2960 [2018-09-30 23:14:13,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=341, Invalid=1381, Unknown=0, NotChecked=0, Total=1722 [2018-09-30 23:14:13,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2018-09-30 23:14:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1191. [2018-09-30 23:14:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-09-30 23:14:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 3784 transitions. [2018-09-30 23:14:16,229 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 3784 transitions. Word has length 11 [2018-09-30 23:14:16,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:14:16,229 INFO L480 AbstractCegarLoop]: Abstraction has 1191 states and 3784 transitions. [2018-09-30 23:14:16,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:14:16,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 3784 transitions. [2018-09-30 23:14:16,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:14:16,231 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:14:16,231 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:14:16,231 INFO L423 AbstractCegarLoop]: === Iteration 70 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:14:16,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:14:16,231 INFO L82 PathProgramCache]: Analyzing trace with hash 888605920, now seen corresponding path program 1 times [2018-09-30 23:14:16,231 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:14:16,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:14:16,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:14:16,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:14:16,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:14:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:14:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:14:16,542 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:14:16,542 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:14:16,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:14:16,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:14:16,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:14:16,543 INFO L87 Difference]: Start difference. First operand 1191 states and 3784 transitions. Second operand 10 states. [2018-09-30 23:14:37,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:14:37,889 INFO L93 Difference]: Finished difference Result 4135 states and 11122 transitions. [2018-09-30 23:14:37,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-30 23:14:37,889 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:14:37,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:14:37,896 INFO L225 Difference]: With dead ends: 4135 [2018-09-30 23:14:37,896 INFO L226 Difference]: Without dead ends: 4126 [2018-09-30 23:14:37,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1912 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=888, Invalid=4812, Unknown=0, NotChecked=0, Total=5700 [2018-09-30 23:14:37,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4126 states. [2018-09-30 23:14:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4126 to 1244. [2018-09-30 23:14:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2018-09-30 23:14:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 3975 transitions. [2018-09-30 23:14:40,702 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 3975 transitions. Word has length 11 [2018-09-30 23:14:40,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:14:40,702 INFO L480 AbstractCegarLoop]: Abstraction has 1244 states and 3975 transitions. [2018-09-30 23:14:40,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:14:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 3975 transitions. [2018-09-30 23:14:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:14:40,703 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:14:40,703 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:14:40,704 INFO L423 AbstractCegarLoop]: === Iteration 71 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:14:40,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:14:40,704 INFO L82 PathProgramCache]: Analyzing trace with hash 888605923, now seen corresponding path program 1 times [2018-09-30 23:14:40,704 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:14:40,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:14:40,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:14:40,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:14:40,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:14:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:14:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:14:40,849 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:14:40,849 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:14:40,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:14:40,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:14:40,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:14:40,850 INFO L87 Difference]: Start difference. First operand 1244 states and 3975 transitions. Second operand 10 states. [2018-09-30 23:14:56,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:14:56,570 INFO L93 Difference]: Finished difference Result 3332 states and 9049 transitions. [2018-09-30 23:14:56,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 23:14:56,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:14:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:14:56,586 INFO L225 Difference]: With dead ends: 3332 [2018-09-30 23:14:56,586 INFO L226 Difference]: Without dead ends: 3323 [2018-09-30 23:14:56,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=317, Invalid=1405, Unknown=0, NotChecked=0, Total=1722 [2018-09-30 23:14:56,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2018-09-30 23:14:59,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 1265. [2018-09-30 23:14:59,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2018-09-30 23:14:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 4049 transitions. [2018-09-30 23:14:59,407 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 4049 transitions. Word has length 11 [2018-09-30 23:14:59,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:14:59,407 INFO L480 AbstractCegarLoop]: Abstraction has 1265 states and 4049 transitions. [2018-09-30 23:14:59,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:14:59,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 4049 transitions. [2018-09-30 23:14:59,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:14:59,408 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:14:59,408 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:14:59,408 INFO L423 AbstractCegarLoop]: === Iteration 72 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:14:59,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:14:59,408 INFO L82 PathProgramCache]: Analyzing trace with hash 888605926, now seen corresponding path program 1 times [2018-09-30 23:14:59,408 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:14:59,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:14:59,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:14:59,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:14:59,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:14:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:14:59,680 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-30 23:14:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:14:59,974 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:14:59,974 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:14:59,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:14:59,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:14:59,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:14:59,975 INFO L87 Difference]: Start difference. First operand 1265 states and 4049 transitions. Second operand 10 states. [2018-09-30 23:15:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:15:14,363 INFO L93 Difference]: Finished difference Result 3029 states and 8339 transitions. [2018-09-30 23:15:14,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-30 23:15:14,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:15:14,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:15:14,369 INFO L225 Difference]: With dead ends: 3029 [2018-09-30 23:15:14,369 INFO L226 Difference]: Without dead ends: 3026 [2018-09-30 23:15:14,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=293, Invalid=1189, Unknown=0, NotChecked=0, Total=1482 [2018-09-30 23:15:14,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3026 states. [2018-09-30 23:15:17,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 1249. [2018-09-30 23:15:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1249 states. [2018-09-30 23:15:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 3989 transitions. [2018-09-30 23:15:17,216 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 3989 transitions. Word has length 11 [2018-09-30 23:15:17,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:15:17,217 INFO L480 AbstractCegarLoop]: Abstraction has 1249 states and 3989 transitions. [2018-09-30 23:15:17,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:15:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 3989 transitions. [2018-09-30 23:15:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:15:17,218 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:15:17,218 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:15:17,218 INFO L423 AbstractCegarLoop]: === Iteration 73 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:15:17,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:15:17,219 INFO L82 PathProgramCache]: Analyzing trace with hash 558747878, now seen corresponding path program 1 times [2018-09-30 23:15:17,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:15:17,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:15:17,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:15:17,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:15:17,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:15:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:15:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:15:17,369 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:15:17,369 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:15:17,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:15:17,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:15:17,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:15:17,370 INFO L87 Difference]: Start difference. First operand 1249 states and 3989 transitions. Second operand 10 states. [2018-09-30 23:15:40,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:15:40,337 INFO L93 Difference]: Finished difference Result 4529 states and 12161 transitions. [2018-09-30 23:15:40,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-30 23:15:40,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:15:40,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:15:40,344 INFO L225 Difference]: With dead ends: 4529 [2018-09-30 23:15:40,344 INFO L226 Difference]: Without dead ends: 4520 [2018-09-30 23:15:40,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=808, Invalid=3884, Unknown=0, NotChecked=0, Total=4692 [2018-09-30 23:15:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2018-09-30 23:15:43,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 1267. [2018-09-30 23:15:43,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1267 states. [2018-09-30 23:15:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 4032 transitions. [2018-09-30 23:15:43,350 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 4032 transitions. Word has length 11 [2018-09-30 23:15:43,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:15:43,350 INFO L480 AbstractCegarLoop]: Abstraction has 1267 states and 4032 transitions. [2018-09-30 23:15:43,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:15:43,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 4032 transitions. [2018-09-30 23:15:43,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:15:43,351 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:15:43,351 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:15:43,352 INFO L423 AbstractCegarLoop]: === Iteration 74 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:15:43,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:15:43,352 INFO L82 PathProgramCache]: Analyzing trace with hash 558747881, now seen corresponding path program 1 times [2018-09-30 23:15:43,352 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:15:43,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:15:43,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:15:43,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:15:43,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:15:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:15:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:15:43,496 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:15:43,497 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:15:43,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:15:43,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:15:43,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:15:43,497 INFO L87 Difference]: Start difference. First operand 1267 states and 4032 transitions. Second operand 10 states. [2018-09-30 23:15:58,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:15:58,500 INFO L93 Difference]: Finished difference Result 3085 states and 8513 transitions. [2018-09-30 23:15:58,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-30 23:15:58,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:15:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:15:58,505 INFO L225 Difference]: With dead ends: 3085 [2018-09-30 23:15:58,505 INFO L226 Difference]: Without dead ends: 3076 [2018-09-30 23:15:58,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=276, Invalid=984, Unknown=0, NotChecked=0, Total=1260 [2018-09-30 23:15:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3076 states. [2018-09-30 23:16:01,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3076 to 1305. [2018-09-30 23:16:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2018-09-30 23:16:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 4165 transitions. [2018-09-30 23:16:01,599 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 4165 transitions. Word has length 11 [2018-09-30 23:16:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:16:01,600 INFO L480 AbstractCegarLoop]: Abstraction has 1305 states and 4165 transitions. [2018-09-30 23:16:01,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:16:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 4165 transitions. [2018-09-30 23:16:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:16:01,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:16:01,600 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:16:01,601 INFO L423 AbstractCegarLoop]: === Iteration 75 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:16:01,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:16:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash 558747884, now seen corresponding path program 1 times [2018-09-30 23:16:01,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:16:01,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:16:01,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:16:01,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:16:01,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:16:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:16:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:16:01,713 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:16:01,713 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:16:01,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:16:01,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:16:01,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:16:01,714 INFO L87 Difference]: Start difference. First operand 1305 states and 4165 transitions. Second operand 10 states. [2018-09-30 23:16:17,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:16:17,476 INFO L93 Difference]: Finished difference Result 3119 states and 8661 transitions. [2018-09-30 23:16:17,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-30 23:16:17,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:16:17,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:16:17,481 INFO L225 Difference]: With dead ends: 3119 [2018-09-30 23:16:17,482 INFO L226 Difference]: Without dead ends: 3110 [2018-09-30 23:16:17,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=334, Invalid=1226, Unknown=0, NotChecked=0, Total=1560 [2018-09-30 23:16:17,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2018-09-30 23:16:20,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 1341. [2018-09-30 23:16:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-09-30 23:16:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4276 transitions. [2018-09-30 23:16:20,757 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4276 transitions. Word has length 11 [2018-09-30 23:16:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:16:20,757 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4276 transitions. [2018-09-30 23:16:20,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:16:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4276 transitions. [2018-09-30 23:16:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:16:20,758 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:16:20,758 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:16:20,758 INFO L423 AbstractCegarLoop]: === Iteration 76 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:16:20,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:16:20,758 INFO L82 PathProgramCache]: Analyzing trace with hash 910106073, now seen corresponding path program 1 times [2018-09-30 23:16:20,759 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:16:20,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:16:20,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:16:20,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:16:20,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:16:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:16:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:16:20,966 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:16:20,966 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:16:20,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:16:20,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:16:20,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:16:20,967 INFO L87 Difference]: Start difference. First operand 1341 states and 4276 transitions. Second operand 10 states. [2018-09-30 23:16:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:16:34,941 INFO L93 Difference]: Finished difference Result 2739 states and 7735 transitions. [2018-09-30 23:16:34,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 23:16:34,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:16:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:16:34,946 INFO L225 Difference]: With dead ends: 2739 [2018-09-30 23:16:34,946 INFO L226 Difference]: Without dead ends: 2730 [2018-09-30 23:16:34,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2018-09-30 23:16:34,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2018-09-30 23:16:38,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 1376. [2018-09-30 23:16:38,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1376 states. [2018-09-30 23:16:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 4395 transitions. [2018-09-30 23:16:38,433 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 4395 transitions. Word has length 11 [2018-09-30 23:16:38,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:16:38,434 INFO L480 AbstractCegarLoop]: Abstraction has 1376 states and 4395 transitions. [2018-09-30 23:16:38,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:16:38,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 4395 transitions. [2018-09-30 23:16:38,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:16:38,435 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:16:38,435 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:16:38,435 INFO L423 AbstractCegarLoop]: === Iteration 77 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:16:38,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:16:38,435 INFO L82 PathProgramCache]: Analyzing trace with hash 910106076, now seen corresponding path program 1 times [2018-09-30 23:16:38,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:16:38,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:16:38,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:16:38,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:16:38,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:16:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:16:38,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:16:38,538 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:16:38,538 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:16:38,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:16:38,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:16:38,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:16:38,539 INFO L87 Difference]: Start difference. First operand 1376 states and 4395 transitions. Second operand 10 states. [2018-09-30 23:16:50,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:16:50,655 INFO L93 Difference]: Finished difference Result 2512 states and 7157 transitions. [2018-09-30 23:16:50,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 23:16:50,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:16:50,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:16:50,660 INFO L225 Difference]: With dead ends: 2512 [2018-09-30 23:16:50,660 INFO L226 Difference]: Without dead ends: 2503 [2018-09-30 23:16:50,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-09-30 23:16:50,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2018-09-30 23:16:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1401. [2018-09-30 23:16:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2018-09-30 23:16:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 4478 transitions. [2018-09-30 23:16:54,290 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 4478 transitions. Word has length 11 [2018-09-30 23:16:54,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:16:54,290 INFO L480 AbstractCegarLoop]: Abstraction has 1401 states and 4478 transitions. [2018-09-30 23:16:54,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:16:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 4478 transitions. [2018-09-30 23:16:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:16:54,291 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:16:54,291 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:16:54,291 INFO L423 AbstractCegarLoop]: === Iteration 78 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:16:54,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:16:54,292 INFO L82 PathProgramCache]: Analyzing trace with hash 910106079, now seen corresponding path program 1 times [2018-09-30 23:16:54,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:16:54,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:16:54,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:16:54,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:16:54,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:16:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:16:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:16:54,429 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:16:54,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:16:54,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:16:54,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:16:54,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:16:54,430 INFO L87 Difference]: Start difference. First operand 1401 states and 4478 transitions. Second operand 10 states. [2018-09-30 23:17:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:17:09,952 INFO L93 Difference]: Finished difference Result 3207 states and 9059 transitions. [2018-09-30 23:17:09,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 23:17:09,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:17:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:17:09,958 INFO L225 Difference]: With dead ends: 3207 [2018-09-30 23:17:09,958 INFO L226 Difference]: Without dead ends: 3198 [2018-09-30 23:17:09,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2018-09-30 23:17:09,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3198 states. [2018-09-30 23:17:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3198 to 1415. [2018-09-30 23:17:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2018-09-30 23:17:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 4523 transitions. [2018-09-30 23:17:13,578 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 4523 transitions. Word has length 11 [2018-09-30 23:17:13,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:17:13,579 INFO L480 AbstractCegarLoop]: Abstraction has 1415 states and 4523 transitions. [2018-09-30 23:17:13,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:17:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 4523 transitions. [2018-09-30 23:17:13,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:17:13,580 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:17:13,580 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:17:13,580 INFO L423 AbstractCegarLoop]: === Iteration 79 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:17:13,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:17:13,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1141109579, now seen corresponding path program 1 times [2018-09-30 23:17:13,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:17:13,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:17:13,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:17:13,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:17:13,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:17:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:17:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:17:13,755 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:17:13,756 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:17:13,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:17:13,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:17:13,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:17:13,756 INFO L87 Difference]: Start difference. First operand 1415 states and 4523 transitions. Second operand 10 states. [2018-09-30 23:17:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:17:25,271 INFO L93 Difference]: Finished difference Result 2338 states and 6757 transitions. [2018-09-30 23:17:25,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:17:25,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:17:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:17:25,275 INFO L225 Difference]: With dead ends: 2338 [2018-09-30 23:17:25,275 INFO L226 Difference]: Without dead ends: 2329 [2018-09-30 23:17:25,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:17:25,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2018-09-30 23:17:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 1454. [2018-09-30 23:17:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2018-09-30 23:17:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 4664 transitions. [2018-09-30 23:17:29,099 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 4664 transitions. Word has length 11 [2018-09-30 23:17:29,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:17:29,099 INFO L480 AbstractCegarLoop]: Abstraction has 1454 states and 4664 transitions. [2018-09-30 23:17:29,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:17:29,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 4664 transitions. [2018-09-30 23:17:29,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:17:29,100 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:17:29,100 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:17:29,100 INFO L423 AbstractCegarLoop]: === Iteration 80 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:17:29,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:17:29,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1141109582, now seen corresponding path program 1 times [2018-09-30 23:17:29,101 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:17:29,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:17:29,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:17:29,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:17:29,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:17:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:17:29,278 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-09-30 23:17:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:17:29,881 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:17:29,881 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:17:29,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:17:29,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:17:29,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:17:29,882 INFO L87 Difference]: Start difference. First operand 1454 states and 4664 transitions. Second operand 10 states. [2018-09-30 23:17:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:17:41,028 INFO L93 Difference]: Finished difference Result 3078 states and 9084 transitions. [2018-09-30 23:17:41,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:17:41,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:17:41,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:17:41,032 INFO L225 Difference]: With dead ends: 3078 [2018-09-30 23:17:41,032 INFO L226 Difference]: Without dead ends: 2252 [2018-09-30 23:17:41,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-09-30 23:17:41,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2018-09-30 23:17:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 1520. [2018-09-30 23:17:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2018-09-30 23:17:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 4843 transitions. [2018-09-30 23:17:44,858 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 4843 transitions. Word has length 11 [2018-09-30 23:17:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:17:44,858 INFO L480 AbstractCegarLoop]: Abstraction has 1520 states and 4843 transitions. [2018-09-30 23:17:44,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:17:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 4843 transitions. [2018-09-30 23:17:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:17:44,859 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:17:44,859 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:17:44,859 INFO L423 AbstractCegarLoop]: === Iteration 81 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:17:44,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:17:44,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1141109585, now seen corresponding path program 1 times [2018-09-30 23:17:44,859 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:17:44,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:17:44,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:17:44,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:17:44,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:17:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:17:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:17:45,091 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:17:45,092 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:17:45,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:17:45,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:17:45,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:17:45,092 INFO L87 Difference]: Start difference. First operand 1520 states and 4843 transitions. Second operand 10 states. [2018-09-30 23:17:58,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:17:58,577 INFO L93 Difference]: Finished difference Result 2757 states and 7897 transitions. [2018-09-30 23:17:58,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:17:58,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:17:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:17:58,582 INFO L225 Difference]: With dead ends: 2757 [2018-09-30 23:17:58,582 INFO L226 Difference]: Without dead ends: 2748 [2018-09-30 23:17:58,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-09-30 23:17:58,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2018-09-30 23:18:03,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 1677. [2018-09-30 23:18:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2018-09-30 23:18:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 5316 transitions. [2018-09-30 23:18:03,041 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 5316 transitions. Word has length 11 [2018-09-30 23:18:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:18:03,041 INFO L480 AbstractCegarLoop]: Abstraction has 1677 states and 5316 transitions. [2018-09-30 23:18:03,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:18:03,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 5316 transitions. [2018-09-30 23:18:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:18:03,042 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:18:03,042 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:18:03,042 INFO L423 AbstractCegarLoop]: === Iteration 82 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:18:03,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:18:03,043 INFO L82 PathProgramCache]: Analyzing trace with hash 641174699, now seen corresponding path program 1 times [2018-09-30 23:18:03,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:18:03,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:18:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:18:03,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:18:03,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:18:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:18:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:18:03,172 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:18:03,172 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:18:03,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:18:03,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:18:03,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:18:03,172 INFO L87 Difference]: Start difference. First operand 1677 states and 5316 transitions. Second operand 10 states. [2018-09-30 23:18:19,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:18:19,059 INFO L93 Difference]: Finished difference Result 3023 states and 8545 transitions. [2018-09-30 23:18:19,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-30 23:18:19,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:18:19,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:18:19,065 INFO L225 Difference]: With dead ends: 3023 [2018-09-30 23:18:19,065 INFO L226 Difference]: Without dead ends: 3014 [2018-09-30 23:18:19,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=258, Invalid=1148, Unknown=0, NotChecked=0, Total=1406 [2018-09-30 23:18:19,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2018-09-30 23:18:23,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 1721. [2018-09-30 23:18:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1721 states. [2018-09-30 23:18:23,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 5467 transitions. [2018-09-30 23:18:23,695 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 5467 transitions. Word has length 11 [2018-09-30 23:18:23,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:18:23,695 INFO L480 AbstractCegarLoop]: Abstraction has 1721 states and 5467 transitions. [2018-09-30 23:18:23,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:18:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 5467 transitions. [2018-09-30 23:18:23,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:18:23,697 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:18:23,697 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:18:23,698 INFO L423 AbstractCegarLoop]: === Iteration 83 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:18:23,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:18:23,698 INFO L82 PathProgramCache]: Analyzing trace with hash 641174702, now seen corresponding path program 1 times [2018-09-30 23:18:23,698 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:18:23,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:18:23,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:18:23,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:18:23,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:18:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:18:23,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:18:23,795 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:18:23,795 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:18:23,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:18:23,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:18:23,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:18:23,796 INFO L87 Difference]: Start difference. First operand 1721 states and 5467 transitions. Second operand 10 states. [2018-09-30 23:18:39,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:18:39,499 INFO L93 Difference]: Finished difference Result 2959 states and 8425 transitions. [2018-09-30 23:18:39,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 23:18:39,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:18:39,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:18:39,504 INFO L225 Difference]: With dead ends: 2959 [2018-09-30 23:18:39,504 INFO L226 Difference]: Without dead ends: 2950 [2018-09-30 23:18:39,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 23:18:39,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2018-09-30 23:18:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1706. [2018-09-30 23:18:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2018-09-30 23:18:44,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 5408 transitions. [2018-09-30 23:18:44,138 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 5408 transitions. Word has length 11 [2018-09-30 23:18:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:18:44,138 INFO L480 AbstractCegarLoop]: Abstraction has 1706 states and 5408 transitions. [2018-09-30 23:18:44,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:18:44,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 5408 transitions. [2018-09-30 23:18:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:18:44,140 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:18:44,140 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:18:44,140 INFO L423 AbstractCegarLoop]: === Iteration 84 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:18:44,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:18:44,140 INFO L82 PathProgramCache]: Analyzing trace with hash 641174705, now seen corresponding path program 1 times [2018-09-30 23:18:44,140 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:18:44,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:18:44,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:18:44,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:18:44,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:18:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:18:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:18:44,922 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:18:44,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:18:44,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:18:44,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:18:44,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:18:44,923 INFO L87 Difference]: Start difference. First operand 1706 states and 5408 transitions. Second operand 10 states. [2018-09-30 23:19:03,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:19:03,556 INFO L93 Difference]: Finished difference Result 3515 states and 10000 transitions. [2018-09-30 23:19:03,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 23:19:03,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:19:03,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:19:03,562 INFO L225 Difference]: With dead ends: 3515 [2018-09-30 23:19:03,563 INFO L226 Difference]: Without dead ends: 3512 [2018-09-30 23:19:03,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=216, Invalid=906, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 23:19:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2018-09-30 23:19:08,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 1674. [2018-09-30 23:19:08,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2018-09-30 23:19:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 5323 transitions. [2018-09-30 23:19:08,202 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 5323 transitions. Word has length 11 [2018-09-30 23:19:08,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:19:08,202 INFO L480 AbstractCegarLoop]: Abstraction has 1674 states and 5323 transitions. [2018-09-30 23:19:08,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:19:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 5323 transitions. [2018-09-30 23:19:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:19:08,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:19:08,203 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:19:08,203 INFO L423 AbstractCegarLoop]: === Iteration 85 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:19:08,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:19:08,203 INFO L82 PathProgramCache]: Analyzing trace with hash 311316657, now seen corresponding path program 1 times [2018-09-30 23:19:08,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:19:08,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:19:08,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:19:08,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:19:08,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:19:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:19:08,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:19:08,526 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:19:08,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:19:08,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:19:08,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:19:08,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:19:08,527 INFO L87 Difference]: Start difference. First operand 1674 states and 5323 transitions. Second operand 10 states. [2018-09-30 23:19:27,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:19:27,857 INFO L93 Difference]: Finished difference Result 3480 states and 9801 transitions. [2018-09-30 23:19:27,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-30 23:19:27,858 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:19:27,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:19:27,863 INFO L225 Difference]: With dead ends: 3480 [2018-09-30 23:19:27,864 INFO L226 Difference]: Without dead ends: 3471 [2018-09-30 23:19:27,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=400, Invalid=1952, Unknown=0, NotChecked=0, Total=2352 [2018-09-30 23:19:27,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3471 states. [2018-09-30 23:19:32,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3471 to 1683. [2018-09-30 23:19:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2018-09-30 23:19:32,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 5340 transitions. [2018-09-30 23:19:32,732 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 5340 transitions. Word has length 11 [2018-09-30 23:19:32,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:19:32,732 INFO L480 AbstractCegarLoop]: Abstraction has 1683 states and 5340 transitions. [2018-09-30 23:19:32,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:19:32,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 5340 transitions. [2018-09-30 23:19:32,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:19:32,734 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:19:32,734 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:19:32,735 INFO L423 AbstractCegarLoop]: === Iteration 86 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:19:32,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:19:32,735 INFO L82 PathProgramCache]: Analyzing trace with hash 311316660, now seen corresponding path program 1 times [2018-09-30 23:19:32,735 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:19:32,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:19:32,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:19:32,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:19:32,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:19:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:19:32,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:19:32,847 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:19:32,847 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:19:32,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:19:32,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:19:32,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:19:32,848 INFO L87 Difference]: Start difference. First operand 1683 states and 5340 transitions. Second operand 10 states. [2018-09-30 23:19:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:19:49,758 INFO L93 Difference]: Finished difference Result 3012 states and 8515 transitions. [2018-09-30 23:19:49,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 23:19:49,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:19:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:19:49,763 INFO L225 Difference]: With dead ends: 3012 [2018-09-30 23:19:49,763 INFO L226 Difference]: Without dead ends: 3003 [2018-09-30 23:19:49,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2018-09-30 23:19:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2018-09-30 23:19:54,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 1674. [2018-09-30 23:19:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2018-09-30 23:19:54,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 5309 transitions. [2018-09-30 23:19:54,412 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 5309 transitions. Word has length 11 [2018-09-30 23:19:54,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:19:54,412 INFO L480 AbstractCegarLoop]: Abstraction has 1674 states and 5309 transitions. [2018-09-30 23:19:54,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 23:19:54,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 5309 transitions. [2018-09-30 23:19:54,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 23:19:54,414 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:19:54,414 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:19:54,414 INFO L423 AbstractCegarLoop]: === Iteration 87 === [productErr20ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-09-30 23:19:54,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:19:54,414 INFO L82 PathProgramCache]: Analyzing trace with hash 311316663, now seen corresponding path program 1 times [2018-09-30 23:19:54,414 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:19:54,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:19:54,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:19:54,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:19:54,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:19:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:19:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:19:54,508 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:19:54,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-30 23:19:54,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 23:19:54,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 23:19:54,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-30 23:19:54,508 INFO L87 Difference]: Start difference. First operand 1674 states and 5309 transitions. Second operand 10 states. [2018-09-30 23:20:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:20:15,261 INFO L93 Difference]: Finished difference Result 3799 states and 10741 transitions. [2018-09-30 23:20:15,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 23:20:15,261 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 23:20:15,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:20:15,268 INFO L225 Difference]: With dead ends: 3799 [2018-09-30 23:20:15,268 INFO L226 Difference]: Without dead ends: 3790 [2018-09-30 23:20:15,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=1279, Unknown=0, NotChecked=0, Total=1560 [2018-09-30 23:20:15,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3790 states. Received shutdown request... [2018-09-30 23:20:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3790 to 1613. [2018-09-30 23:20:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2018-09-30 23:20:19,845 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 23:20:19,850 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 23:20:19,850 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 11:20:19 BoogieIcfgContainer [2018-09-30 23:20:19,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 23:20:19,851 INFO L168 Benchmark]: Toolchain (without parser) took 841262.90 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 456.1 MB). Free memory was 1.4 GB in the beginning and 812.6 MB in the end (delta: 610.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-09-30 23:20:19,852 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:20:19,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:20:19,853 INFO L168 Benchmark]: Boogie Preprocessor took 55.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:20:19,853 INFO L168 Benchmark]: RCFGBuilder took 1196.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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-09-30 23:20:19,854 INFO L168 Benchmark]: TraceAbstraction took 839939.44 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 456.1 MB). Free memory was 1.4 GB in the beginning and 812.6 MB in the end (delta: 568.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-09-30 23:20:19,856 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.48 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1196.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 839939.44 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 456.1 MB). Free memory was 1.4 GB in the beginning and 812.6 MB in the end (delta: 568.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 645). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 199). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 599]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 599). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 194]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 194). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 316]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 316). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 95). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 584]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 584). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 816]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 816). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 589). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 71). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 847]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 847). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 594). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 223]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 223). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 569). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 675). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 446]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 446). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 800]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 800). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 574). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 263]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 263). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 640). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 470]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 470). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 337). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 624]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 624). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 604]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 604). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 660). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 579). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 832). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 27 error locations. TIMEOUT Result, 839.8s OverallTime, 87 OverallIterations, 2 TraceHistogramMax, 665.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 25499 SDtfs, 55925 SDslu, 53138 SDs, 0 SdLazy, 246424 SolverSat, 19035 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 259.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1834 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1807 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11904 ImplicationChecksByTransitivity, 42.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2723occurred in iteration=57, 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: 157.9s AutomataMinimizationTime, 87 MinimizatonAttempts, 98955 StatesRemovedByMinimization, 86 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 778 NumberOfCodeBlocks, 778 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 691 ConstructedInterpolants, 0 QuantifiedInterpolants, 55913 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 87 InterpolantComputations, 87 PerfectInterpolantSequences, 7/7 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-09-30_23-20-19-871.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-09-30_23-20-19-871.csv Completed graceful shutdown