java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:36:22,451 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:36:22,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:36:22,469 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:36:22,469 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:36:22,471 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:36:22,473 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:36:22,475 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:36:22,476 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:36:22,477 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:36:22,478 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:36:22,478 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:36:22,479 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:36:22,480 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:36:22,481 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:36:22,482 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:36:22,483 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:36:22,485 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:36:22,487 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:36:22,488 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:36:22,489 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:36:22,491 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:36:22,493 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:36:22,494 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:36:22,494 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:36:22,495 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:36:22,496 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:36:22,497 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:36:22,498 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:36:22,499 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:36:22,499 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:36:22,500 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:36:22,500 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:36:22,500 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:36:22,501 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:36:22,502 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:36:22,502 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 09:36:22,518 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:36:22,518 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:36:22,519 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:36:22,519 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:36:22,520 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:36:22,520 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:36:22,520 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:36:22,520 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:36:22,521 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:36:22,521 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:36:22,521 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:36:22,521 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:36:22,521 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:36:22,521 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:36:22,522 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:36:22,522 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:36:22,522 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:36:22,522 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:36:22,522 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:36:22,523 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:36:22,523 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:36:22,523 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:36:22,523 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:36:22,523 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:36:22,524 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:36:22,524 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:36:22,524 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:36:22,524 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:36:22,524 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:36:22,524 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:36:22,525 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:36:22,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:36:22,587 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:36:22,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:36:22,595 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:36:22,595 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:36:22,596 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl [2018-10-04 09:36:22,596 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-10-04 09:36:22,688 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:36:22,689 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:36:22,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:36:22,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:36:22,691 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:36:22,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:22" (1/1) ... [2018-10-04 09:36:22,736 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:22" (1/1) ... [2018-10-04 09:36:22,752 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 09:36:22,752 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 09:36:22,752 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 09:36:22,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:36:22,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:36:22,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:36:22,757 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:36:22,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:22" (1/1) ... [2018-10-04 09:36:22,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:22" (1/1) ... [2018-10-04 09:36:22,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:22" (1/1) ... [2018-10-04 09:36:22,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:22" (1/1) ... [2018-10-04 09:36:22,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:22" (1/1) ... [2018-10-04 09:36:22,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:22" (1/1) ... [2018-10-04 09:36:22,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:22" (1/1) ... [2018-10-04 09:36:22,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:36:22,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:36:22,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:36:22,823 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:36:22,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:36:22,900 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-04 09:36:22,900 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-04 09:36:22,900 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-04 09:36:24,126 INFO L338 CfgBuilder]: Using library mode [2018-10-04 09:36:24,127 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:36:24 BoogieIcfgContainer [2018-10-04 09:36:24,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:36:24,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:36:24,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:36:24,131 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:36:24,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:36:22" (1/2) ... [2018-10-04 09:36:24,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6fa32d and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:36:24, skipping insertion in model container [2018-10-04 09:36:24,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:36:24" (2/2) ... [2018-10-04 09:36:24,135 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-10-04 09:36:24,144 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:36:24,155 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-10-04 09:36:24,210 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:36:24,211 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:36:24,211 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:36:24,211 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:36:24,211 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:36:24,211 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:36:24,212 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:36:24,212 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:36:24,212 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:36:24,232 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-10-04 09:36:24,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 09:36:24,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:24,241 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 09:36:24,244 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:24,251 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:24,251 INFO L82 PathProgramCache]: Analyzing trace with hash 45506320, now seen corresponding path program 1 times [2018-10-04 09:36:24,255 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:24,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:24,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:24,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:24,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:24,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:24,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:24,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:36:24,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:36:24,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:36:24,520 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:24,522 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 5 states. [2018-10-04 09:36:26,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:26,328 INFO L93 Difference]: Finished difference Result 142 states and 303 transitions. [2018-10-04 09:36:26,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:36:26,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 09:36:26,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:26,349 INFO L225 Difference]: With dead ends: 142 [2018-10-04 09:36:26,349 INFO L226 Difference]: Without dead ends: 138 [2018-10-04 09:36:26,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 09:36:26,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-04 09:36:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2018-10-04 09:36:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-04 09:36:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 219 transitions. [2018-10-04 09:36:26,414 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 219 transitions. Word has length 5 [2018-10-04 09:36:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:26,415 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 219 transitions. [2018-10-04 09:36:26,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:36:26,416 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 219 transitions. [2018-10-04 09:36:26,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 09:36:26,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:26,421 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 09:36:26,422 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:26,423 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:26,425 INFO L82 PathProgramCache]: Analyzing trace with hash 45756290, now seen corresponding path program 1 times [2018-10-04 09:36:26,425 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:26,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:26,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:26,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:26,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:26,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:26,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:26,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:36:26,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:36:26,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:36:26,585 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:26,587 INFO L87 Difference]: Start difference. First operand 98 states and 219 transitions. Second operand 5 states. [2018-10-04 09:36:28,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:28,246 INFO L93 Difference]: Finished difference Result 241 states and 539 transitions. [2018-10-04 09:36:28,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:36:28,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 09:36:28,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:28,252 INFO L225 Difference]: With dead ends: 241 [2018-10-04 09:36:28,252 INFO L226 Difference]: Without dead ends: 237 [2018-10-04 09:36:28,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 6 [2018-10-04 09:36:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-04 09:36:28,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 134. [2018-10-04 09:36:28,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-04 09:36:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2018-10-04 09:36:28,292 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 5 [2018-10-04 09:36:28,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:28,292 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2018-10-04 09:36:28,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:36:28,293 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2018-10-04 09:36:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 09:36:28,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:28,294 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 09:36:28,295 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:28,295 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:28,296 INFO L82 PathProgramCache]: Analyzing trace with hash 28948051, now seen corresponding path program 1 times [2018-10-04 09:36:28,296 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:28,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:28,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:28,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:28,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:28,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:28,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:36:28,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:36:28,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:36:28,466 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:28,466 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 5 states. [2018-10-04 09:36:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:30,147 INFO L93 Difference]: Finished difference Result 269 states and 639 transitions. [2018-10-04 09:36:30,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:36:30,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 09:36:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:30,156 INFO L225 Difference]: With dead ends: 269 [2018-10-04 09:36:30,158 INFO L226 Difference]: Without dead ends: 265 [2018-10-04 09:36:30,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 09:36:30,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-04 09:36:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 162. [2018-10-04 09:36:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-04 09:36:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 455 transitions. [2018-10-04 09:36:30,223 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 455 transitions. Word has length 5 [2018-10-04 09:36:30,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:30,224 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 455 transitions. [2018-10-04 09:36:30,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:36:30,224 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 455 transitions. [2018-10-04 09:36:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:36:30,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:30,232 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:30,237 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:30,237 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:30,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558066, now seen corresponding path program 1 times [2018-10-04 09:36:30,238 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:30,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:30,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:30,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:30,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:30,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:30,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:30,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:36:30,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:36:30,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:36:30,531 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:30,531 INFO L87 Difference]: Start difference. First operand 162 states and 455 transitions. Second operand 8 states. [2018-10-04 09:36:34,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:34,764 INFO L93 Difference]: Finished difference Result 790 states and 2085 transitions. [2018-10-04 09:36:34,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 09:36:34,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:36:34,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:34,770 INFO L225 Difference]: With dead ends: 790 [2018-10-04 09:36:34,771 INFO L226 Difference]: Without dead ends: 629 [2018-10-04 09:36:34,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 10 [2018-10-04 09:36:34,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-04 09:36:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 278. [2018-10-04 09:36:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-04 09:36:34,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 854 transitions. [2018-10-04 09:36:34,828 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 854 transitions. Word has length 8 [2018-10-04 09:36:34,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:34,828 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 854 transitions. [2018-10-04 09:36:34,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:36:34,828 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 854 transitions. [2018-10-04 09:36:34,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:36:34,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:34,831 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:34,832 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:34,832 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:34,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558063, now seen corresponding path program 1 times [2018-10-04 09:36:34,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:34,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:34,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:34,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:34,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:35,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:35,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:36:35,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:36:35,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:36:35,026 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:35,026 INFO L87 Difference]: Start difference. First operand 278 states and 854 transitions. Second operand 8 states. [2018-10-04 09:36:38,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:38,846 INFO L93 Difference]: Finished difference Result 634 states and 1540 transitions. [2018-10-04 09:36:38,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:36:38,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:36:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:38,852 INFO L225 Difference]: With dead ends: 634 [2018-10-04 09:36:38,852 INFO L226 Difference]: Without dead ends: 628 [2018-10-04 09:36:38,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 16 [2018-10-04 09:36:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-10-04 09:36:38,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 310. [2018-10-04 09:36:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-04 09:36:38,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 963 transitions. [2018-10-04 09:36:38,935 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 963 transitions. Word has length 8 [2018-10-04 09:36:38,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:38,936 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 963 transitions. [2018-10-04 09:36:38,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:36:38,936 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 963 transitions. [2018-10-04 09:36:38,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:36:38,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:38,938 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:38,939 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:38,939 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:38,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1080099218, now seen corresponding path program 1 times [2018-10-04 09:36:38,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:38,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:38,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:38,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:38,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:39,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:39,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:36:39,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:36:39,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:36:39,032 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:39,032 INFO L87 Difference]: Start difference. First operand 310 states and 963 transitions. Second operand 8 states. [2018-10-04 09:36:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:42,937 INFO L93 Difference]: Finished difference Result 768 states and 2087 transitions. [2018-10-04 09:36:42,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 09:36:42,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:36:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:42,943 INFO L225 Difference]: With dead ends: 768 [2018-10-04 09:36:42,944 INFO L226 Difference]: Without dead ends: 537 [2018-10-04 09:36:42,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 9 [2018-10-04 09:36:42,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-10-04 09:36:43,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 334. [2018-10-04 09:36:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-04 09:36:43,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1037 transitions. [2018-10-04 09:36:43,008 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1037 transitions. Word has length 8 [2018-10-04 09:36:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:43,008 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1037 transitions. [2018-10-04 09:36:43,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:36:43,008 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1037 transitions. [2018-10-04 09:36:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:36:43,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:43,010 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:43,011 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:43,011 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:43,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595081, now seen corresponding path program 1 times [2018-10-04 09:36:43,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:43,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:43,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:43,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:43,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:43,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:43,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:36:43,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:36:43,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:36:43,118 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:43,118 INFO L87 Difference]: Start difference. First operand 334 states and 1037 transitions. Second operand 8 states. [2018-10-04 09:36:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:45,886 INFO L93 Difference]: Finished difference Result 1145 states and 3146 transitions. [2018-10-04 09:36:45,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:36:45,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:36:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:45,893 INFO L225 Difference]: With dead ends: 1145 [2018-10-04 09:36:45,893 INFO L226 Difference]: Without dead ends: 812 [2018-10-04 09:36:45,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 17 [2018-10-04 09:36:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-10-04 09:36:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 450. [2018-10-04 09:36:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-10-04 09:36:46,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1432 transitions. [2018-10-04 09:36:46,039 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1432 transitions. Word has length 8 [2018-10-04 09:36:46,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:46,039 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1432 transitions. [2018-10-04 09:36:46,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:36:46,040 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1432 transitions. [2018-10-04 09:36:46,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:36:46,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:46,042 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:46,049 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:46,049 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:46,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595078, now seen corresponding path program 1 times [2018-10-04 09:36:46,049 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:46,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:46,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:46,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:46,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:46,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:46,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:36:46,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:36:46,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:36:46,736 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:46,736 INFO L87 Difference]: Start difference. First operand 450 states and 1432 transitions. Second operand 8 states. [2018-10-04 09:36:49,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:49,300 INFO L93 Difference]: Finished difference Result 877 states and 2260 transitions. [2018-10-04 09:36:49,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 09:36:49,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:36:49,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:49,307 INFO L225 Difference]: With dead ends: 877 [2018-10-04 09:36:49,307 INFO L226 Difference]: Without dead ends: 871 [2018-10-04 09:36:49,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 10 [2018-10-04 09:36:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-10-04 09:36:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 478. [2018-10-04 09:36:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-10-04 09:36:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1531 transitions. [2018-10-04 09:36:49,426 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1531 transitions. Word has length 8 [2018-10-04 09:36:49,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:49,426 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 1531 transitions. [2018-10-04 09:36:49,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:36:49,427 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1531 transitions. [2018-10-04 09:36:49,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:36:49,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:49,428 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:49,428 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:49,429 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:49,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064444, now seen corresponding path program 1 times [2018-10-04 09:36:49,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:49,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:49,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:49,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:49,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:49,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:49,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:36:49,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:36:49,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:36:49,560 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:49,560 INFO L87 Difference]: Start difference. First operand 478 states and 1531 transitions. Second operand 8 states. [2018-10-04 09:36:52,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:52,030 INFO L93 Difference]: Finished difference Result 1049 states and 2854 transitions. [2018-10-04 09:36:52,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 09:36:52,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:36:52,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:52,037 INFO L225 Difference]: With dead ends: 1049 [2018-10-04 09:36:52,037 INFO L226 Difference]: Without dead ends: 818 [2018-10-04 09:36:52,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 14 [2018-10-04 09:36:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-10-04 09:36:52,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 524. [2018-10-04 09:36:52,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-04 09:36:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1684 transitions. [2018-10-04 09:36:52,199 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1684 transitions. Word has length 8 [2018-10-04 09:36:52,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:52,200 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 1684 transitions. [2018-10-04 09:36:52,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:36:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1684 transitions. [2018-10-04 09:36:52,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:36:52,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:52,201 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:52,202 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:52,202 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:52,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064441, now seen corresponding path program 1 times [2018-10-04 09:36:52,203 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:52,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:52,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:52,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:52,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:52,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:52,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:36:52,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:36:52,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:36:52,294 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:52,294 INFO L87 Difference]: Start difference. First operand 524 states and 1684 transitions. Second operand 8 states. [2018-10-04 09:36:54,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:54,102 INFO L93 Difference]: Finished difference Result 733 states and 1997 transitions. [2018-10-04 09:36:54,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 09:36:54,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:36:54,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:54,108 INFO L225 Difference]: With dead ends: 733 [2018-10-04 09:36:54,109 INFO L226 Difference]: Without dead ends: 727 [2018-10-04 09:36:54,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:36:54,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-10-04 09:36:54,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 530. [2018-10-04 09:36:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-10-04 09:36:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1690 transitions. [2018-10-04 09:36:54,269 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1690 transitions. Word has length 8 [2018-10-04 09:36:54,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:54,269 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1690 transitions. [2018-10-04 09:36:54,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:36:54,270 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1690 transitions. [2018-10-04 09:36:54,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:36:54,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:54,271 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:54,272 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:54,272 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:54,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656691, now seen corresponding path program 1 times [2018-10-04 09:36:54,272 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:54,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:54,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:54,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:54,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:54,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:54,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:54,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:36:54,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:36:54,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:36:54,487 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:54,487 INFO L87 Difference]: Start difference. First operand 530 states and 1690 transitions. Second operand 8 states. [2018-10-04 09:36:55,487 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 09:36:58,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:36:58,206 INFO L93 Difference]: Finished difference Result 1329 states and 3609 transitions. [2018-10-04 09:36:58,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 09:36:58,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:36:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:36:58,216 INFO L225 Difference]: With dead ends: 1329 [2018-10-04 09:36:58,216 INFO L226 Difference]: Without dead ends: 1323 [2018-10-04 09:36:58,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 10 [2018-10-04 09:36:58,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-10-04 09:36:58,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 626. [2018-10-04 09:36:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-10-04 09:36:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 2087 transitions. [2018-10-04 09:36:58,405 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 2087 transitions. Word has length 8 [2018-10-04 09:36:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:36:58,405 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 2087 transitions. [2018-10-04 09:36:58,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:36:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 2087 transitions. [2018-10-04 09:36:58,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:36:58,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:36:58,407 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:36:58,408 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:36:58,408 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:36:58,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656688, now seen corresponding path program 1 times [2018-10-04 09:36:58,408 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:36:58,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:36:58,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:58,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:36:58,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:36:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:36:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:36:58,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:36:58,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:36:58,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:36:58,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:36:58,506 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:36:58,506 INFO L87 Difference]: Start difference. First operand 626 states and 2087 transitions. Second operand 8 states. [2018-10-04 09:37:00,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:00,964 INFO L93 Difference]: Finished difference Result 1268 states and 3539 transitions. [2018-10-04 09:37:00,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 09:37:00,965 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:37:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:00,975 INFO L225 Difference]: With dead ends: 1268 [2018-10-04 09:37:00,975 INFO L226 Difference]: Without dead ends: 1262 [2018-10-04 09:37:00,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 15 [2018-10-04 09:37:00,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-10-04 09:37:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 618. [2018-10-04 09:37:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-04 09:37:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2056 transitions. [2018-10-04 09:37:01,180 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2056 transitions. Word has length 8 [2018-10-04 09:37:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:01,180 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 2056 transitions. [2018-10-04 09:37:01,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:37:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2056 transitions. [2018-10-04 09:37:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:37:01,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:01,182 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:01,182 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:01,183 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:01,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285639, now seen corresponding path program 1 times [2018-10-04 09:37:01,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:01,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:01,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:01,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:01,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:01,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:01,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:37:01,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:37:01,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:37:01,361 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:01,362 INFO L87 Difference]: Start difference. First operand 618 states and 2056 transitions. Second operand 8 states. [2018-10-04 09:37:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:04,005 INFO L93 Difference]: Finished difference Result 1367 states and 3876 transitions. [2018-10-04 09:37:04,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 09:37:04,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:37:04,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:04,013 INFO L225 Difference]: With dead ends: 1367 [2018-10-04 09:37:04,013 INFO L226 Difference]: Without dead ends: 1361 [2018-10-04 09:37:04,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 15 [2018-10-04 09:37:04,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-10-04 09:37:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 671. [2018-10-04 09:37:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-10-04 09:37:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2249 transitions. [2018-10-04 09:37:04,226 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2249 transitions. Word has length 8 [2018-10-04 09:37:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:04,226 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 2249 transitions. [2018-10-04 09:37:04,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:37:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2249 transitions. [2018-10-04 09:37:04,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:37:04,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:04,227 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:04,228 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:04,228 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:04,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285636, now seen corresponding path program 1 times [2018-10-04 09:37:04,228 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:04,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:04,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:04,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:04,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:04,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:04,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:37:04,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:37:04,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:37:04,327 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:04,328 INFO L87 Difference]: Start difference. First operand 671 states and 2249 transitions. Second operand 8 states. [2018-10-04 09:37:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:07,742 INFO L93 Difference]: Finished difference Result 1373 states and 3787 transitions. [2018-10-04 09:37:07,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 09:37:07,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:37:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:07,752 INFO L225 Difference]: With dead ends: 1373 [2018-10-04 09:37:07,752 INFO L226 Difference]: Without dead ends: 1367 [2018-10-04 09:37:07,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 17 [2018-10-04 09:37:07,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-10-04 09:37:07,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 698. [2018-10-04 09:37:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-10-04 09:37:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2344 transitions. [2018-10-04 09:37:07,982 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2344 transitions. Word has length 8 [2018-10-04 09:37:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:07,983 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 2344 transitions. [2018-10-04 09:37:07,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:37:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2344 transitions. [2018-10-04 09:37:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:37:07,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:07,984 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:07,985 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:07,985 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:07,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280348, now seen corresponding path program 1 times [2018-10-04 09:37:07,986 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:07,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:07,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:07,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:07,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:08,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:08,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 09:37:08,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:37:08,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:37:08,077 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:08,077 INFO L87 Difference]: Start difference. First operand 698 states and 2344 transitions. Second operand 7 states. [2018-10-04 09:37:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:10,555 INFO L93 Difference]: Finished difference Result 1526 states and 4298 transitions. [2018-10-04 09:37:10,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:37:10,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 09:37:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:10,563 INFO L225 Difference]: With dead ends: 1526 [2018-10-04 09:37:10,564 INFO L226 Difference]: Without dead ends: 1520 [2018-10-04 09:37:10,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 14 [2018-10-04 09:37:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-10-04 09:37:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 789. [2018-10-04 09:37:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-10-04 09:37:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2673 transitions. [2018-10-04 09:37:10,846 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2673 transitions. Word has length 8 [2018-10-04 09:37:10,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:10,846 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 2673 transitions. [2018-10-04 09:37:10,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:37:10,847 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2673 transitions. [2018-10-04 09:37:10,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:37:10,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:10,848 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:10,848 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:10,848 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:10,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280221, now seen corresponding path program 1 times [2018-10-04 09:37:10,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:10,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:10,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:10,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:10,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:10,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:10,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:10,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 09:37:10,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:37:10,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:37:10,942 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:10,942 INFO L87 Difference]: Start difference. First operand 789 states and 2673 transitions. Second operand 7 states. [2018-10-04 09:37:13,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:13,658 INFO L93 Difference]: Finished difference Result 1548 states and 4356 transitions. [2018-10-04 09:37:13,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:37:13,658 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 09:37:13,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:13,666 INFO L225 Difference]: With dead ends: 1548 [2018-10-04 09:37:13,666 INFO L226 Difference]: Without dead ends: 1542 [2018-10-04 09:37:13,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 15 [2018-10-04 09:37:13,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-10-04 09:37:14,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 821. [2018-10-04 09:37:14,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-04 09:37:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2801 transitions. [2018-10-04 09:37:14,006 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2801 transitions. Word has length 8 [2018-10-04 09:37:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:14,006 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 2801 transitions. [2018-10-04 09:37:14,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:37:14,007 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2801 transitions. [2018-10-04 09:37:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:37:14,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:14,008 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:14,008 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:14,008 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:14,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878937, now seen corresponding path program 1 times [2018-10-04 09:37:14,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:14,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:14,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:14,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:14,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:14,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:14,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 09:37:14,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:37:14,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:37:14,325 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:14,325 INFO L87 Difference]: Start difference. First operand 821 states and 2801 transitions. Second operand 7 states. [2018-10-04 09:37:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:17,116 INFO L93 Difference]: Finished difference Result 1575 states and 4539 transitions. [2018-10-04 09:37:17,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:37:17,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 09:37:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:17,124 INFO L225 Difference]: With dead ends: 1575 [2018-10-04 09:37:17,124 INFO L226 Difference]: Without dead ends: 1569 [2018-10-04 09:37:17,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 14 [2018-10-04 09:37:17,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-10-04 09:37:17,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 849. [2018-10-04 09:37:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-10-04 09:37:17,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2913 transitions. [2018-10-04 09:37:17,437 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2913 transitions. Word has length 8 [2018-10-04 09:37:17,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:17,437 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 2913 transitions. [2018-10-04 09:37:17,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:37:17,437 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2913 transitions. [2018-10-04 09:37:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:37:17,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:17,438 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:17,439 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:17,439 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:17,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878810, now seen corresponding path program 1 times [2018-10-04 09:37:17,439 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:17,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:17,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:17,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:17,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:17,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:17,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 09:37:17,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:37:17,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:37:17,519 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:17,519 INFO L87 Difference]: Start difference. First operand 849 states and 2913 transitions. Second operand 7 states. [2018-10-04 09:37:19,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:19,986 INFO L93 Difference]: Finished difference Result 1597 states and 4579 transitions. [2018-10-04 09:37:19,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 09:37:19,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 09:37:19,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:19,997 INFO L225 Difference]: With dead ends: 1597 [2018-10-04 09:37:19,997 INFO L226 Difference]: Without dead ends: 1591 [2018-10-04 09:37:19,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-04 09:37:19,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-10-04 09:37:20,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 873. [2018-10-04 09:37:20,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-10-04 09:37:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2993 transitions. [2018-10-04 09:37:20,331 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2993 transitions. Word has length 8 [2018-10-04 09:37:20,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:20,331 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 2993 transitions. [2018-10-04 09:37:20,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:37:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2993 transitions. [2018-10-04 09:37:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:37:20,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:20,333 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:20,334 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:20,334 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:20,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288024, now seen corresponding path program 1 times [2018-10-04 09:37:20,334 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:20,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:20,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:20,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:20,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:20,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:20,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 09:37:20,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:37:20,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:37:20,457 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:20,458 INFO L87 Difference]: Start difference. First operand 873 states and 2993 transitions. Second operand 7 states. [2018-10-04 09:37:22,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:22,861 INFO L93 Difference]: Finished difference Result 1726 states and 5211 transitions. [2018-10-04 09:37:22,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:37:22,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 09:37:22,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:22,875 INFO L225 Difference]: With dead ends: 1726 [2018-10-04 09:37:22,875 INFO L226 Difference]: Without dead ends: 1720 [2018-10-04 09:37:22,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 11 [2018-10-04 09:37:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2018-10-04 09:37:23,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1006. [2018-10-04 09:37:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-10-04 09:37:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3474 transitions. [2018-10-04 09:37:23,296 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3474 transitions. Word has length 8 [2018-10-04 09:37:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:23,296 INFO L480 AbstractCegarLoop]: Abstraction has 1006 states and 3474 transitions. [2018-10-04 09:37:23,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:37:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3474 transitions. [2018-10-04 09:37:23,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:37:23,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:23,298 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:23,298 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:23,298 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:23,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288027, now seen corresponding path program 1 times [2018-10-04 09:37:23,298 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:23,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:23,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:23,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:23,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:23,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:23,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 09:37:23,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:37:23,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:37:23,391 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:23,391 INFO L87 Difference]: Start difference. First operand 1006 states and 3474 transitions. Second operand 7 states. [2018-10-04 09:37:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:26,611 INFO L93 Difference]: Finished difference Result 1758 states and 5203 transitions. [2018-10-04 09:37:26,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 09:37:26,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 09:37:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:26,618 INFO L225 Difference]: With dead ends: 1758 [2018-10-04 09:37:26,619 INFO L226 Difference]: Without dead ends: 1752 [2018-10-04 09:37:26,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-04 09:37:26,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-10-04 09:37:27,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1011. [2018-10-04 09:37:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-10-04 09:37:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3493 transitions. [2018-10-04 09:37:27,077 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3493 transitions. Word has length 8 [2018-10-04 09:37:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:27,077 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 3493 transitions. [2018-10-04 09:37:27,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:37:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3493 transitions. [2018-10-04 09:37:27,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:37:27,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:27,078 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:27,078 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:27,078 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:27,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746872, now seen corresponding path program 1 times [2018-10-04 09:37:27,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:27,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:27,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:27,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:27,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:27,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:27,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 09:37:27,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:37:27,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:37:27,170 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:27,170 INFO L87 Difference]: Start difference. First operand 1011 states and 3493 transitions. Second operand 7 states. [2018-10-04 09:37:30,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:30,385 INFO L93 Difference]: Finished difference Result 1867 states and 5608 transitions. [2018-10-04 09:37:30,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 09:37:30,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 09:37:30,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:30,392 INFO L225 Difference]: With dead ends: 1867 [2018-10-04 09:37:30,392 INFO L226 Difference]: Without dead ends: 1861 [2018-10-04 09:37:30,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-04 09:37:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2018-10-04 09:37:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1119. [2018-10-04 09:37:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-10-04 09:37:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3931 transitions. [2018-10-04 09:37:30,953 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3931 transitions. Word has length 8 [2018-10-04 09:37:30,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:30,953 INFO L480 AbstractCegarLoop]: Abstraction has 1119 states and 3931 transitions. [2018-10-04 09:37:30,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:37:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3931 transitions. [2018-10-04 09:37:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:37:30,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:30,955 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:30,955 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:30,955 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:30,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746875, now seen corresponding path program 1 times [2018-10-04 09:37:30,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:30,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:30,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:30,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:31,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:31,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 09:37:31,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:37:31,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:37:31,082 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:31,082 INFO L87 Difference]: Start difference. First operand 1119 states and 3931 transitions. Second operand 7 states. [2018-10-04 09:37:34,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:34,773 INFO L93 Difference]: Finished difference Result 1968 states and 5829 transitions. [2018-10-04 09:37:34,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:37:34,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 09:37:34,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:34,783 INFO L225 Difference]: With dead ends: 1968 [2018-10-04 09:37:34,783 INFO L226 Difference]: Without dead ends: 1962 [2018-10-04 09:37:34,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 14 [2018-10-04 09:37:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-10-04 09:37:35,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1111. [2018-10-04 09:37:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-10-04 09:37:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3891 transitions. [2018-10-04 09:37:35,379 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3891 transitions. Word has length 8 [2018-10-04 09:37:35,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:35,379 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 3891 transitions. [2018-10-04 09:37:35,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:37:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3891 transitions. [2018-10-04 09:37:35,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:37:35,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:35,380 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:35,381 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:35,381 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:35,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1616407055, now seen corresponding path program 1 times [2018-10-04 09:37:35,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:35,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:35,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:35,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:35,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:35,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:35,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:35,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 09:37:35,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:37:35,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:37:35,452 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:35,452 INFO L87 Difference]: Start difference. First operand 1111 states and 3891 transitions. Second operand 7 states. [2018-10-04 09:37:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:38,702 INFO L93 Difference]: Finished difference Result 2001 states and 6001 transitions. [2018-10-04 09:37:38,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 09:37:38,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 09:37:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:38,710 INFO L225 Difference]: With dead ends: 2001 [2018-10-04 09:37:38,710 INFO L226 Difference]: Without dead ends: 1995 [2018-10-04 09:37:38,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 13 [2018-10-04 09:37:38,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-10-04 09:37:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1117. [2018-10-04 09:37:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-10-04 09:37:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 3909 transitions. [2018-10-04 09:37:39,434 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 3909 transitions. Word has length 8 [2018-10-04 09:37:39,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:39,434 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 3909 transitions. [2018-10-04 09:37:39,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:37:39,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 3909 transitions. [2018-10-04 09:37:39,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:37:39,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:39,435 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:39,436 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:39,436 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:39,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1616406928, now seen corresponding path program 1 times [2018-10-04 09:37:39,437 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:39,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:39,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:39,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:39,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:39,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:39,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:39,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 09:37:39,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:37:39,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:37:39,514 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:39,515 INFO L87 Difference]: Start difference. First operand 1117 states and 3909 transitions. Second operand 7 states. [2018-10-04 09:37:42,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:42,227 INFO L93 Difference]: Finished difference Result 1708 states and 5233 transitions. [2018-10-04 09:37:42,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:37:42,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 09:37:42,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:42,232 INFO L225 Difference]: With dead ends: 1708 [2018-10-04 09:37:42,232 INFO L226 Difference]: Without dead ends: 1702 [2018-10-04 09:37:42,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 10 [2018-10-04 09:37:42,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-10-04 09:37:42,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1210. [2018-10-04 09:37:42,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2018-10-04 09:37:42,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4307 transitions. [2018-10-04 09:37:42,953 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 4307 transitions. Word has length 8 [2018-10-04 09:37:42,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:42,953 INFO L480 AbstractCegarLoop]: Abstraction has 1210 states and 4307 transitions. [2018-10-04 09:37:42,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:37:42,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 4307 transitions. [2018-10-04 09:37:42,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:37:42,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:42,955 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:42,955 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:42,955 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:42,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256941, now seen corresponding path program 1 times [2018-10-04 09:37:42,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:42,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:42,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:42,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:42,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:43,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:43,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 09:37:43,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:37:43,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:37:43,024 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:43,024 INFO L87 Difference]: Start difference. First operand 1210 states and 4307 transitions. Second operand 7 states. [2018-10-04 09:37:47,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:47,046 INFO L93 Difference]: Finished difference Result 2402 states and 7321 transitions. [2018-10-04 09:37:47,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:37:47,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 09:37:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:47,053 INFO L225 Difference]: With dead ends: 2402 [2018-10-04 09:37:47,053 INFO L226 Difference]: Without dead ends: 2396 [2018-10-04 09:37:47,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 14 [2018-10-04 09:37:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-10-04 09:37:47,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1341. [2018-10-04 09:37:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-10-04 09:37:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4862 transitions. [2018-10-04 09:37:47,773 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4862 transitions. Word has length 8 [2018-10-04 09:37:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:47,773 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4862 transitions. [2018-10-04 09:37:47,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:37:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4862 transitions. [2018-10-04 09:37:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:37:47,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:47,774 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:47,775 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:47,775 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:47,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256944, now seen corresponding path program 1 times [2018-10-04 09:37:47,775 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:47,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:47,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:47,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:47,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:47,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:47,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 09:37:47,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:37:47,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:37:47,866 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:47,866 INFO L87 Difference]: Start difference. First operand 1341 states and 4862 transitions. Second operand 7 states. [2018-10-04 09:37:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:51,586 INFO L93 Difference]: Finished difference Result 2274 states and 6934 transitions. [2018-10-04 09:37:51,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 09:37:51,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 09:37:51,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:51,591 INFO L225 Difference]: With dead ends: 2274 [2018-10-04 09:37:51,591 INFO L226 Difference]: Without dead ends: 2268 [2018-10-04 09:37:51,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 15 [2018-10-04 09:37:51,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2018-10-04 09:37:52,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1337. [2018-10-04 09:37:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-10-04 09:37:52,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 4840 transitions. [2018-10-04 09:37:52,351 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 4840 transitions. Word has length 8 [2018-10-04 09:37:52,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:52,351 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 4840 transitions. [2018-10-04 09:37:52,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:37:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 4840 transitions. [2018-10-04 09:37:52,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:37:52,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:52,352 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-04 09:37:52,352 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:52,352 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:52,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1621267991, now seen corresponding path program 1 times [2018-10-04 09:37:52,352 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:52,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:52,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:52,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:52,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:52,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:52,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:37:52,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:37:52,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:37:52,382 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:52,382 INFO L87 Difference]: Start difference. First operand 1337 states and 4840 transitions. Second operand 4 states. [2018-10-04 09:37:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:53,335 INFO L93 Difference]: Finished difference Result 2170 states and 7637 transitions. [2018-10-04 09:37:53,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:37:53,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-04 09:37:53,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:53,339 INFO L225 Difference]: With dead ends: 2170 [2018-10-04 09:37:53,339 INFO L226 Difference]: Without dead ends: 1253 [2018-10-04 09:37:53,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 2 [2018-10-04 09:37:53,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-10-04 09:37:54,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1080. [2018-10-04 09:37:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-10-04 09:37:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3769 transitions. [2018-10-04 09:37:54,043 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3769 transitions. Word has length 8 [2018-10-04 09:37:54,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:54,043 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 3769 transitions. [2018-10-04 09:37:54,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:37:54,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3769 transitions. [2018-10-04 09:37:54,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:37:54,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:54,045 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:54,045 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:54,045 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:54,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283460, now seen corresponding path program 1 times [2018-10-04 09:37:54,045 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:54,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:54,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:54,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:54,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:37:54,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:54,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:37:54,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:37:54,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:37:54,140 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:54,140 INFO L87 Difference]: Start difference. First operand 1080 states and 3769 transitions. Second operand 8 states. [2018-10-04 09:37:58,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:37:58,508 INFO L93 Difference]: Finished difference Result 2095 states and 6316 transitions. [2018-10-04 09:37:58,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 09:37:58,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:37:58,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:37:58,512 INFO L225 Difference]: With dead ends: 2095 [2018-10-04 09:37:58,512 INFO L226 Difference]: Without dead ends: 2093 [2018-10-04 09:37:58,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 16 [2018-10-04 09:37:58,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-10-04 09:37:59,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1161. [2018-10-04 09:37:59,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2018-10-04 09:37:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 4123 transitions. [2018-10-04 09:37:59,292 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 4123 transitions. Word has length 8 [2018-10-04 09:37:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:37:59,293 INFO L480 AbstractCegarLoop]: Abstraction has 1161 states and 4123 transitions. [2018-10-04 09:37:59,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:37:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 4123 transitions. [2018-10-04 09:37:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:37:59,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:37:59,294 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:37:59,294 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:37:59,294 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:37:59,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283333, now seen corresponding path program 1 times [2018-10-04 09:37:59,294 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:37:59,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:37:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:59,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:37:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:37:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:37:59,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-10-04 09:37:59,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:37:59,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:37:59,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:37:59,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:37:59,927 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:37:59,927 INFO L87 Difference]: Start difference. First operand 1161 states and 4123 transitions. Second operand 8 states. [2018-10-04 09:38:04,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:04,271 INFO L93 Difference]: Finished difference Result 1994 states and 5988 transitions. [2018-10-04 09:38:04,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:38:04,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:38:04,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:04,276 INFO L225 Difference]: With dead ends: 1994 [2018-10-04 09:38:04,276 INFO L226 Difference]: Without dead ends: 1988 [2018-10-04 09:38:04,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 15 [2018-10-04 09:38:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-10-04 09:38:05,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1152. [2018-10-04 09:38:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-10-04 09:38:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 4099 transitions. [2018-10-04 09:38:05,085 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 4099 transitions. Word has length 8 [2018-10-04 09:38:05,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:05,086 INFO L480 AbstractCegarLoop]: Abstraction has 1152 states and 4099 transitions. [2018-10-04 09:38:05,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:38:05,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 4099 transitions. [2018-10-04 09:38:05,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:38:05,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:05,087 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:38:05,088 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:05,088 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:05,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1867882049, now seen corresponding path program 1 times [2018-10-04 09:38:05,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:05,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:05,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:05,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:05,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:38:05,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:38:05,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:38:05,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:38:05,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:38:05,202 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:05,202 INFO L87 Difference]: Start difference. First operand 1152 states and 4099 transitions. Second operand 8 states. [2018-10-04 09:38:10,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:10,252 INFO L93 Difference]: Finished difference Result 2160 states and 6516 transitions. [2018-10-04 09:38:10,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:38:10,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:38:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:10,257 INFO L225 Difference]: With dead ends: 2160 [2018-10-04 09:38:10,257 INFO L226 Difference]: Without dead ends: 2154 [2018-10-04 09:38:10,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 15 [2018-10-04 09:38:10,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2018-10-04 09:38:11,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1174. [2018-10-04 09:38:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-10-04 09:38:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4164 transitions. [2018-10-04 09:38:11,085 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 4164 transitions. Word has length 8 [2018-10-04 09:38:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:11,085 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 4164 transitions. [2018-10-04 09:38:11,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:38:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 4164 transitions. [2018-10-04 09:38:11,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:38:11,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:11,087 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:38:11,087 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:11,088 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:11,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1867881922, now seen corresponding path program 1 times [2018-10-04 09:38:11,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:11,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:11,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:11,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:11,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:38:11,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:38:11,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:38:11,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:38:11,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:38:11,205 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:11,205 INFO L87 Difference]: Start difference. First operand 1174 states and 4164 transitions. Second operand 8 states. [2018-10-04 09:38:16,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:16,179 INFO L93 Difference]: Finished difference Result 2094 states and 6271 transitions. [2018-10-04 09:38:16,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:38:16,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:38:16,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:16,183 INFO L225 Difference]: With dead ends: 2094 [2018-10-04 09:38:16,183 INFO L226 Difference]: Without dead ends: 2088 [2018-10-04 09:38:16,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 14 [2018-10-04 09:38:16,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2018-10-04 09:38:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1153. [2018-10-04 09:38:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-10-04 09:38:17,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 4095 transitions. [2018-10-04 09:38:17,046 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 4095 transitions. Word has length 8 [2018-10-04 09:38:17,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:17,046 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 4095 transitions. [2018-10-04 09:38:17,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:38:17,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 4095 transitions. [2018-10-04 09:38:17,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:38:17,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:17,048 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-04 09:38:17,048 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:17,048 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:17,048 INFO L82 PathProgramCache]: Analyzing trace with hash -896988374, now seen corresponding path program 1 times [2018-10-04 09:38:17,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:17,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:17,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:17,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:17,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:17,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:38:17,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:38:17,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:38:17,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:38:17,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:38:17,074 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:17,075 INFO L87 Difference]: Start difference. First operand 1153 states and 4095 transitions. Second operand 4 states. [2018-10-04 09:38:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:18,368 INFO L93 Difference]: Finished difference Result 1929 states and 6604 transitions. [2018-10-04 09:38:18,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:38:18,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-04 09:38:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:18,371 INFO L225 Difference]: With dead ends: 1929 [2018-10-04 09:38:18,371 INFO L226 Difference]: Without dead ends: 1400 [2018-10-04 09:38:18,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 2 [2018-10-04 09:38:18,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2018-10-04 09:38:19,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1083. [2018-10-04 09:38:19,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2018-10-04 09:38:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3765 transitions. [2018-10-04 09:38:19,222 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 3765 transitions. Word has length 8 [2018-10-04 09:38:19,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:19,222 INFO L480 AbstractCegarLoop]: Abstraction has 1083 states and 3765 transitions. [2018-10-04 09:38:19,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:38:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 3765 transitions. [2018-10-04 09:38:19,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:38:19,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:19,223 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:38:19,224 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:19,224 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:19,224 INFO L82 PathProgramCache]: Analyzing trace with hash -896379114, now seen corresponding path program 1 times [2018-10-04 09:38:19,224 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:19,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:19,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:19,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:19,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:38:19,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:38:19,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:38:19,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:38:19,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:38:19,308 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:19,308 INFO L87 Difference]: Start difference. First operand 1083 states and 3765 transitions. Second operand 8 states. [2018-10-04 09:38:23,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:23,871 INFO L93 Difference]: Finished difference Result 2276 states and 6948 transitions. [2018-10-04 09:38:23,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 09:38:23,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:38:23,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:23,875 INFO L225 Difference]: With dead ends: 2276 [2018-10-04 09:38:23,876 INFO L226 Difference]: Without dead ends: 2270 [2018-10-04 09:38:23,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 14 [2018-10-04 09:38:23,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2018-10-04 09:38:24,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1266. [2018-10-04 09:38:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2018-10-04 09:38:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4418 transitions. [2018-10-04 09:38:24,991 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 4418 transitions. Word has length 8 [2018-10-04 09:38:24,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:24,992 INFO L480 AbstractCegarLoop]: Abstraction has 1266 states and 4418 transitions. [2018-10-04 09:38:24,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:38:24,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 4418 transitions. [2018-10-04 09:38:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:38:24,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:24,993 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:38:24,993 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:24,994 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:24,994 INFO L82 PathProgramCache]: Analyzing trace with hash -896379111, now seen corresponding path program 1 times [2018-10-04 09:38:24,994 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:24,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:24,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:24,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:24,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:38:25,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:38:25,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:38:25,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:38:25,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:38:25,087 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:25,087 INFO L87 Difference]: Start difference. First operand 1266 states and 4418 transitions. Second operand 8 states. [2018-10-04 09:38:30,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:30,186 INFO L93 Difference]: Finished difference Result 2425 states and 7363 transitions. [2018-10-04 09:38:30,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:38:30,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:38:30,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:30,192 INFO L225 Difference]: With dead ends: 2425 [2018-10-04 09:38:30,192 INFO L226 Difference]: Without dead ends: 2419 [2018-10-04 09:38:30,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 18 [2018-10-04 09:38:30,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2018-10-04 09:38:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1373. [2018-10-04 09:38:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2018-10-04 09:38:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 4822 transitions. [2018-10-04 09:38:31,401 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 4822 transitions. Word has length 8 [2018-10-04 09:38:31,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:31,402 INFO L480 AbstractCegarLoop]: Abstraction has 1373 states and 4822 transitions. [2018-10-04 09:38:31,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:38:31,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 4822 transitions. [2018-10-04 09:38:31,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:38:31,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:31,403 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:38:31,403 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:31,404 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:31,404 INFO L82 PathProgramCache]: Analyzing trace with hash -881085998, now seen corresponding path program 1 times [2018-10-04 09:38:31,404 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:31,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:31,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:31,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:31,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:31,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:38:31,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:38:31,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:38:31,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:38:31,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:38:31,482 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:31,482 INFO L87 Difference]: Start difference. First operand 1373 states and 4822 transitions. Second operand 8 states. [2018-10-04 09:38:36,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:36,850 INFO L93 Difference]: Finished difference Result 2278 states and 6952 transitions. [2018-10-04 09:38:36,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 09:38:36,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:38:36,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:36,856 INFO L225 Difference]: With dead ends: 2278 [2018-10-04 09:38:36,856 INFO L226 Difference]: Without dead ends: 2272 [2018-10-04 09:38:36,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 14 [2018-10-04 09:38:36,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2018-10-04 09:38:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1421. [2018-10-04 09:38:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2018-10-04 09:38:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 4963 transitions. [2018-10-04 09:38:38,120 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 4963 transitions. Word has length 8 [2018-10-04 09:38:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:38,120 INFO L480 AbstractCegarLoop]: Abstraction has 1421 states and 4963 transitions. [2018-10-04 09:38:38,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:38:38,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 4963 transitions. [2018-10-04 09:38:38,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:38:38,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:38,121 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:38:38,121 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:38,121 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:38,122 INFO L82 PathProgramCache]: Analyzing trace with hash -881086125, now seen corresponding path program 1 times [2018-10-04 09:38:38,122 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:38,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:38,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:38,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:38,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:38:38,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:38:38,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:38:38,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:38:38,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:38:38,444 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:38,444 INFO L87 Difference]: Start difference. First operand 1421 states and 4963 transitions. Second operand 8 states. [2018-10-04 09:38:43,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:43,560 INFO L93 Difference]: Finished difference Result 2233 states and 6848 transitions. [2018-10-04 09:38:43,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 09:38:43,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:38:43,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:43,566 INFO L225 Difference]: With dead ends: 2233 [2018-10-04 09:38:43,566 INFO L226 Difference]: Without dead ends: 2227 [2018-10-04 09:38:43,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 13 [2018-10-04 09:38:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2018-10-04 09:38:44,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1411. [2018-10-04 09:38:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-10-04 09:38:44,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 4926 transitions. [2018-10-04 09:38:44,787 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 4926 transitions. Word has length 8 [2018-10-04 09:38:44,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:44,787 INFO L480 AbstractCegarLoop]: Abstraction has 1411 states and 4926 transitions. [2018-10-04 09:38:44,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:38:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 4926 transitions. [2018-10-04 09:38:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:38:44,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:44,788 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:38:44,789 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:44,789 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:44,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099334, now seen corresponding path program 1 times [2018-10-04 09:38:44,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:44,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:44,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:44,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:44,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:38:44,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:38:44,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:38:44,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:38:44,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:38:44,884 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:44,884 INFO L87 Difference]: Start difference. First operand 1411 states and 4926 transitions. Second operand 8 states. [2018-10-04 09:38:50,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:50,559 INFO L93 Difference]: Finished difference Result 2558 states and 7836 transitions. [2018-10-04 09:38:50,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 09:38:50,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:38:50,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:50,563 INFO L225 Difference]: With dead ends: 2558 [2018-10-04 09:38:50,563 INFO L226 Difference]: Without dead ends: 2552 [2018-10-04 09:38:50,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 16 [2018-10-04 09:38:50,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-10-04 09:38:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1471. [2018-10-04 09:38:51,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2018-10-04 09:38:51,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 5183 transitions. [2018-10-04 09:38:51,813 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 5183 transitions. Word has length 8 [2018-10-04 09:38:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:51,813 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 5183 transitions. [2018-10-04 09:38:51,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:38:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 5183 transitions. [2018-10-04 09:38:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:38:51,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:51,815 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:38:51,815 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:51,815 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:51,815 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099337, now seen corresponding path program 1 times [2018-10-04 09:38:51,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:51,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:51,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:51,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:51,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:51,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:38:51,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:38:51,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:38:51,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:38:51,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:38:51,901 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:51,901 INFO L87 Difference]: Start difference. First operand 1471 states and 5183 transitions. Second operand 8 states. [2018-10-04 09:38:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:38:57,943 INFO L93 Difference]: Finished difference Result 2703 states and 8278 transitions. [2018-10-04 09:38:57,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:38:57,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:38:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:38:57,948 INFO L225 Difference]: With dead ends: 2703 [2018-10-04 09:38:57,949 INFO L226 Difference]: Without dead ends: 2697 [2018-10-04 09:38:57,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 14 [2018-10-04 09:38:57,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2018-10-04 09:38:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1480. [2018-10-04 09:38:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-10-04 09:38:59,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5200 transitions. [2018-10-04 09:38:59,410 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5200 transitions. Word has length 8 [2018-10-04 09:38:59,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:38:59,410 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5200 transitions. [2018-10-04 09:38:59,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:38:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5200 transitions. [2018-10-04 09:38:59,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:38:59,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:38:59,411 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:38:59,412 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:38:59,412 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:38:59,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629971, now seen corresponding path program 1 times [2018-10-04 09:38:59,412 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:38:59,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:38:59,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:59,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:38:59,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:38:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:38:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:38:59,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:38:59,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:38:59,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:38:59,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:38:59,561 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:38:59,561 INFO L87 Difference]: Start difference. First operand 1480 states and 5200 transitions. Second operand 8 states. [2018-10-04 09:39:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:39:06,068 INFO L93 Difference]: Finished difference Result 2674 states and 8171 transitions. [2018-10-04 09:39:06,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:39:06,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:39:06,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:39:06,074 INFO L225 Difference]: With dead ends: 2674 [2018-10-04 09:39:06,074 INFO L226 Difference]: Without dead ends: 2668 [2018-10-04 09:39:06,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 16 [2018-10-04 09:39:06,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2018-10-04 09:39:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 1480. [2018-10-04 09:39:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-10-04 09:39:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5196 transitions. [2018-10-04 09:39:07,629 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5196 transitions. Word has length 8 [2018-10-04 09:39:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:39:07,630 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5196 transitions. [2018-10-04 09:39:07,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:39:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5196 transitions. [2018-10-04 09:39:07,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:39:07,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:39:07,631 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:39:07,631 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:39:07,631 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:39:07,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629974, now seen corresponding path program 1 times [2018-10-04 09:39:07,632 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:39:07,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:39:07,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:07,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:39:07,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:39:08,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-10-04 09:39:08,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:39:08,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:39:08,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:39:08,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:39:08,116 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:39:08,116 INFO L87 Difference]: Start difference. First operand 1480 states and 5196 transitions. Second operand 8 states. [2018-10-04 09:39:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:39:14,968 INFO L93 Difference]: Finished difference Result 2722 states and 8299 transitions. [2018-10-04 09:39:14,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 09:39:14,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:39:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:39:14,973 INFO L225 Difference]: With dead ends: 2722 [2018-10-04 09:39:14,973 INFO L226 Difference]: Without dead ends: 2716 [2018-10-04 09:39:14,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 14 [2018-10-04 09:39:14,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2018-10-04 09:39:16,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 1462. [2018-10-04 09:39:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2018-10-04 09:39:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 5124 transitions. [2018-10-04 09:39:16,442 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 5124 transitions. Word has length 8 [2018-10-04 09:39:16,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:39:16,442 INFO L480 AbstractCegarLoop]: Abstraction has 1462 states and 5124 transitions. [2018-10-04 09:39:16,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:39:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 5124 transitions. [2018-10-04 09:39:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:39:16,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:39:16,443 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:39:16,443 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:39:16,443 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:39:16,443 INFO L82 PathProgramCache]: Analyzing trace with hash 278041308, now seen corresponding path program 1 times [2018-10-04 09:39:16,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:39:16,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:39:16,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:16,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:39:16,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:39:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:39:16,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:39:16,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:39:16,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:39:16,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:39:16,728 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:39:16,728 INFO L87 Difference]: Start difference. First operand 1462 states and 5124 transitions. Second operand 8 states. [2018-10-04 09:39:22,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:39:22,704 INFO L93 Difference]: Finished difference Result 2962 states and 9218 transitions. [2018-10-04 09:39:22,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:39:22,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 09:39:22,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:39:22,710 INFO L225 Difference]: With dead ends: 2962 [2018-10-04 09:39:22,711 INFO L226 Difference]: Without dead ends: 2956 [2018-10-04 09:39:22,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 12 [2018-10-04 09:39:22,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2018-10-04 09:39:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1776. [2018-10-04 09:39:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-10-04 09:39:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 6236 transitions. [2018-10-04 09:39:24,632 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 6236 transitions. Word has length 9 [2018-10-04 09:39:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:39:24,632 INFO L480 AbstractCegarLoop]: Abstraction has 1776 states and 6236 transitions. [2018-10-04 09:39:24,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:39:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 6236 transitions. [2018-10-04 09:39:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:39:24,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:39:24,634 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:39:24,634 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:39:24,634 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:39:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash 278041683, now seen corresponding path program 1 times [2018-10-04 09:39:24,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:39:24,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:39:24,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:24,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:39:24,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:39:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:39:24,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:39:24,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:39:24,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:39:24,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:39:24,713 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:39:24,713 INFO L87 Difference]: Start difference. First operand 1776 states and 6236 transitions. Second operand 8 states. [2018-10-04 09:39:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:39:30,879 INFO L93 Difference]: Finished difference Result 2948 states and 9162 transitions. [2018-10-04 09:39:30,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:39:30,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 09:39:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:39:30,886 INFO L225 Difference]: With dead ends: 2948 [2018-10-04 09:39:30,886 INFO L226 Difference]: Without dead ends: 2942 [2018-10-04 09:39:30,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-04 09:39:30,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2018-10-04 09:39:32,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1772. [2018-10-04 09:39:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-10-04 09:39:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 6220 transitions. [2018-10-04 09:39:32,936 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 6220 transitions. Word has length 9 [2018-10-04 09:39:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:39:32,936 INFO L480 AbstractCegarLoop]: Abstraction has 1772 states and 6220 transitions. [2018-10-04 09:39:32,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:39:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 6220 transitions. [2018-10-04 09:39:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:39:32,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:39:32,937 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:39:32,938 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:39:32,938 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:39:32,938 INFO L82 PathProgramCache]: Analyzing trace with hash 541105076, now seen corresponding path program 1 times [2018-10-04 09:39:32,938 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:39:32,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:39:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:32,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:39:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:39:33,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:39:33,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:39:33,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:39:33,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:39:33,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:39:33,013 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:39:33,014 INFO L87 Difference]: Start difference. First operand 1772 states and 6220 transitions. Second operand 8 states. [2018-10-04 09:39:40,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:39:40,190 INFO L93 Difference]: Finished difference Result 3238 states and 9970 transitions. [2018-10-04 09:39:40,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:39:40,190 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 09:39:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:39:40,196 INFO L225 Difference]: With dead ends: 3238 [2018-10-04 09:39:40,196 INFO L226 Difference]: Without dead ends: 3232 [2018-10-04 09:39:40,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 13 [2018-10-04 09:39:40,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2018-10-04 09:39:42,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1799. [2018-10-04 09:39:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-10-04 09:39:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 6288 transitions. [2018-10-04 09:39:42,255 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 6288 transitions. Word has length 9 [2018-10-04 09:39:42,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:39:42,255 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 6288 transitions. [2018-10-04 09:39:42,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:39:42,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 6288 transitions. [2018-10-04 09:39:42,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:39:42,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:39:42,257 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:39:42,257 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:39:42,257 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:39:42,257 INFO L82 PathProgramCache]: Analyzing trace with hash 541105451, now seen corresponding path program 1 times [2018-10-04 09:39:42,257 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:39:42,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:39:42,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:42,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:39:42,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:39:42,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:39:42,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:39:42,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:39:42,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:39:42,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:39:42,349 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:39:42,349 INFO L87 Difference]: Start difference. First operand 1799 states and 6288 transitions. Second operand 8 states. [2018-10-04 09:39:49,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:39:49,672 INFO L93 Difference]: Finished difference Result 3212 states and 9854 transitions. [2018-10-04 09:39:49,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:39:49,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 09:39:49,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:39:49,679 INFO L225 Difference]: With dead ends: 3212 [2018-10-04 09:39:49,679 INFO L226 Difference]: Without dead ends: 3206 [2018-10-04 09:39:49,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 13 [2018-10-04 09:39:49,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2018-10-04 09:39:51,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 1737. [2018-10-04 09:39:51,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2018-10-04 09:39:51,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 6062 transitions. [2018-10-04 09:39:51,636 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 6062 transitions. Word has length 9 [2018-10-04 09:39:51,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:39:51,636 INFO L480 AbstractCegarLoop]: Abstraction has 1737 states and 6062 transitions. [2018-10-04 09:39:51,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:39:51,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 6062 transitions. [2018-10-04 09:39:51,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:39:51,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:39:51,638 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:39:51,638 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:39:51,638 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:39:51,638 INFO L82 PathProgramCache]: Analyzing trace with hash 825189368, now seen corresponding path program 1 times [2018-10-04 09:39:51,638 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:39:51,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:39:51,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:51,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:39:51,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:39:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:39:51,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-10-04 09:39:51,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:39:51,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:39:51,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:39:51,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:39:51,714 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:39:51,714 INFO L87 Difference]: Start difference. First operand 1737 states and 6062 transitions. Second operand 8 states. [2018-10-04 09:39:58,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:39:58,506 INFO L93 Difference]: Finished difference Result 3315 states and 10043 transitions. [2018-10-04 09:39:58,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:39:58,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 09:39:58,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:39:58,512 INFO L225 Difference]: With dead ends: 3315 [2018-10-04 09:39:58,512 INFO L226 Difference]: Without dead ends: 3309 [2018-10-04 09:39:58,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-04 09:39:58,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2018-10-04 09:40:00,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 1985. [2018-10-04 09:40:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2018-10-04 09:40:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 6886 transitions. [2018-10-04 09:40:00,829 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 6886 transitions. Word has length 9 [2018-10-04 09:40:00,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:00,829 INFO L480 AbstractCegarLoop]: Abstraction has 1985 states and 6886 transitions. [2018-10-04 09:40:00,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:40:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 6886 transitions. [2018-10-04 09:40:00,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:40:00,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:00,831 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:00,831 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:00,831 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:00,832 INFO L82 PathProgramCache]: Analyzing trace with hash 825189371, now seen corresponding path program 1 times [2018-10-04 09:40:00,832 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:00,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:00,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:00,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:00,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:00,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:40:00,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:00,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:40:00,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:40:00,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:40:00,905 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:00,905 INFO L87 Difference]: Start difference. First operand 1985 states and 6886 transitions. Second operand 8 states. [2018-10-04 09:40:08,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:08,858 INFO L93 Difference]: Finished difference Result 3446 states and 10415 transitions. [2018-10-04 09:40:08,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:40:08,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 09:40:08,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:08,865 INFO L225 Difference]: With dead ends: 3446 [2018-10-04 09:40:08,865 INFO L226 Difference]: Without dead ends: 3440 [2018-10-04 09:40:08,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 15 [2018-10-04 09:40:08,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2018-10-04 09:40:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 1927. [2018-10-04 09:40:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1927 states. [2018-10-04 09:40:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 6663 transitions. [2018-10-04 09:40:11,250 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 6663 transitions. Word has length 9 [2018-10-04 09:40:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:11,250 INFO L480 AbstractCegarLoop]: Abstraction has 1927 states and 6663 transitions. [2018-10-04 09:40:11,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:40:11,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 6663 transitions. [2018-10-04 09:40:11,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:40:11,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:11,251 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:11,252 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:11,252 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:11,252 INFO L82 PathProgramCache]: Analyzing trace with hash 832700792, now seen corresponding path program 1 times [2018-10-04 09:40:11,252 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:11,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:11,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:11,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:11,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:40:11,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:11,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 09:40:11,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:40:11,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:40:11,328 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:11,329 INFO L87 Difference]: Start difference. First operand 1927 states and 6663 transitions. Second operand 8 states. [2018-10-04 09:40:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:17,964 INFO L93 Difference]: Finished difference Result 2832 states and 8631 transitions. [2018-10-04 09:40:17,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:40:17,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 09:40:17,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:17,969 INFO L225 Difference]: With dead ends: 2832 [2018-10-04 09:40:17,969 INFO L226 Difference]: Without dead ends: 2824 [2018-10-04 09:40:17,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-04 09:40:17,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2018-10-04 09:40:20,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 1904. [2018-10-04 09:40:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-10-04 09:40:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 6553 transitions. [2018-10-04 09:40:20,399 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 6553 transitions. Word has length 9 [2018-10-04 09:40:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:20,399 INFO L480 AbstractCegarLoop]: Abstraction has 1904 states and 6553 transitions. [2018-10-04 09:40:20,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:40:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 6553 transitions. [2018-10-04 09:40:20,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:40:20,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:20,401 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:20,401 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:20,401 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:20,401 INFO L82 PathProgramCache]: Analyzing trace with hash -595843680, now seen corresponding path program 1 times [2018-10-04 09:40:20,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:20,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:20,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:20,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:20,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:20,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-10-04 09:40:20,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:20,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:40:20,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:40:20,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:40:20,508 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:20,508 INFO L87 Difference]: Start difference. First operand 1904 states and 6553 transitions. Second operand 9 states. [2018-10-04 09:40:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:27,667 INFO L93 Difference]: Finished difference Result 3157 states and 9716 transitions. [2018-10-04 09:40:27,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:40:27,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 09:40:27,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:27,673 INFO L225 Difference]: With dead ends: 3157 [2018-10-04 09:40:27,673 INFO L226 Difference]: Without dead ends: 3151 [2018-10-04 09:40:27,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 14 [2018-10-04 09:40:27,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2018-10-04 09:40:30,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 1949. [2018-10-04 09:40:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2018-10-04 09:40:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 6722 transitions. [2018-10-04 09:40:30,011 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 6722 transitions. Word has length 9 [2018-10-04 09:40:30,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:30,012 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 6722 transitions. [2018-10-04 09:40:30,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:40:30,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 6722 transitions. [2018-10-04 09:40:30,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:40:30,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:30,013 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:30,013 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:30,014 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:30,014 INFO L82 PathProgramCache]: Analyzing trace with hash -595843677, now seen corresponding path program 1 times [2018-10-04 09:40:30,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:30,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:30,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:30,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:30,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:40:30,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:30,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:40:30,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:40:30,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:40:30,105 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:30,105 INFO L87 Difference]: Start difference. First operand 1949 states and 6722 transitions. Second operand 9 states. [2018-10-04 09:40:31,117 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 09:40:39,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:40:39,968 INFO L93 Difference]: Finished difference Result 3822 states and 11523 transitions. [2018-10-04 09:40:39,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 09:40:39,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 09:40:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:40:39,976 INFO L225 Difference]: With dead ends: 3822 [2018-10-04 09:40:39,976 INFO L226 Difference]: Without dead ends: 3816 [2018-10-04 09:40:39,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 13 [2018-10-04 09:40:39,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2018-10-04 09:40:42,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 2098. [2018-10-04 09:40:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-10-04 09:40:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 7405 transitions. [2018-10-04 09:40:42,640 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 7405 transitions. Word has length 9 [2018-10-04 09:40:42,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:40:42,640 INFO L480 AbstractCegarLoop]: Abstraction has 2098 states and 7405 transitions. [2018-10-04 09:40:42,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:40:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 7405 transitions. [2018-10-04 09:40:42,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:40:42,642 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:40:42,642 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:40:42,642 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr15ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:40:42,642 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:40:42,642 INFO L82 PathProgramCache]: Analyzing trace with hash -204435682, now seen corresponding path program 1 times [2018-10-04 09:40:42,642 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:40:42,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:40:42,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:42,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:40:42,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:40:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:40:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:40:42,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:40:42,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 09:40:42,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:40:42,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:40:42,771 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:40:42,771 INFO L87 Difference]: Start difference. First operand 2098 states and 7405 transitions. Second operand 9 states. [2018-10-04 09:40:45,009 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 Received shutdown request... [2018-10-04 09:40:48,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 09:40:48,206 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 09:40:48,212 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 09:40:48,212 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:40:48 BoogieIcfgContainer [2018-10-04 09:40:48,212 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:40:48,213 INFO L168 Benchmark]: Toolchain (without parser) took 265524.65 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 159.0 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-04 09:40:48,215 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:40:48,216 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:40:48,217 INFO L168 Benchmark]: Boogie Preprocessor took 65.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:40:48,218 INFO L168 Benchmark]: RCFGBuilder took 1304.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-04 09:40:48,219 INFO L168 Benchmark]: TraceAbstraction took 264084.29 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 116.7 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-04 09:40:48,223 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1304.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 264084.29 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 116.7 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 194]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 194). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 624]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 624). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 847]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 316]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 316). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 816]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 816). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 199). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 263]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 263). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 604]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 604). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 95). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 584]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 584). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 223]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 223). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 470]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 470). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 446]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 446). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 599]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 599). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 337). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 71). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 800]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 800). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (2098states) and FLOYD_HOARE automaton (currently 27 states, 9 states before enhancement), while ReachableStatesComputation was computing reachable states (1412 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 27 error locations. TIMEOUT Result, 264.0s OverallTime, 50 OverallIterations, 2 TraceHistogramMax, 212.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13835 SDtfs, 24813 SDslu, 26414 SDs, 0 SdLazy, 95143 SolverSat, 9047 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 105.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 765 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 761 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2098occurred in iteration=49, 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: 43.4s AutomataMinimizationTime, 49 MinimizatonAttempts, 38917 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 351 ConstructedInterpolants, 0 QuantifiedInterpolants, 34870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 50 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-40-48-237.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-40-48-237.csv Completed graceful shutdown