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-9f4048f-m [2018-10-04 14:19:51,615 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:19:51,620 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:19:51,637 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:19:51,637 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:19:51,639 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:19:51,640 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:19:51,642 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:19:51,645 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:19:51,648 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:19:51,651 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:19:51,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:19:51,652 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:19:51,653 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:19:51,656 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:19:51,658 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:19:51,658 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:19:51,668 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:19:51,671 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:19:51,672 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:19:51,674 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:19:51,675 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:19:51,677 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:19:51,677 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:19:51,677 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:19:51,678 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:19:51,679 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:19:51,680 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:19:51,681 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:19:51,682 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:19:51,682 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:19:51,683 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:19:51,683 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:19:51,683 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:19:51,685 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:19:51,685 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:19:51,687 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 14:19:51,714 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:19:51,714 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:19:51,715 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:19:51,715 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:19:51,716 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:19:51,716 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:19:51,716 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:19:51,716 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:19:51,717 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:19:51,717 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:19:51,717 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:19:51,717 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:19:51,717 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:19:51,718 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:19:51,718 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:19:51,718 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:19:51,718 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:19:51,718 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:19:51,719 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:19:51,719 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:19:51,719 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:19:51,719 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:19:51,720 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:19:51,720 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:19:51,720 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:19:51,721 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:19:51,721 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:19:51,721 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:19:51,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:19:51,721 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:19:51,722 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:19:51,784 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:19:51,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:19:51,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:19:51,808 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:19:51,809 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:19:51,810 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 14:19:51,810 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-10-04 14:19:51,919 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:19:51,921 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:19:51,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:19:51,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:19:51,922 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:19:51,942 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 02:19:51" (1/1) ... [2018-10-04 14:19:51,962 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 02:19:51" (1/1) ... [2018-10-04 14:19:51,977 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 14:19:51,978 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 14:19:51,978 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 14:19:51,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:19:51,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:19:51,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:19:51,982 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:19:51,993 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 02:19:51" (1/1) ... [2018-10-04 14:19:51,993 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 02:19:51" (1/1) ... [2018-10-04 14:19:51,996 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 02:19:51" (1/1) ... [2018-10-04 14:19:51,997 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 02:19:51" (1/1) ... [2018-10-04 14:19:52,006 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 02:19:51" (1/1) ... [2018-10-04 14:19:52,017 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 02:19:51" (1/1) ... [2018-10-04 14:19:52,022 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 02:19:51" (1/1) ... [2018-10-04 14:19:52,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:19:52,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:19:52,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:19:52,032 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:19:52,033 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 02:19:51" (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 14:19:52,117 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-04 14:19:52,117 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-04 14:19:52,117 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-04 14:19:53,304 INFO L338 CfgBuilder]: Using library mode [2018-10-04 14:19:53,305 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:19:53 BoogieIcfgContainer [2018-10-04 14:19:53,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:19:53,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:19:53,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:19:53,310 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:19:53,311 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 02:19:51" (1/2) ... [2018-10-04 14:19:53,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be5552f and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:19:53, skipping insertion in model container [2018-10-04 14:19:53,312 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 02:19:53" (2/2) ... [2018-10-04 14:19:53,314 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-10-04 14:19:53,323 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:19:53,332 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-10-04 14:19:53,383 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:19:53,383 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:19:53,384 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:19:53,384 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:19:53,384 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:19:53,384 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:19:53,384 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:19:53,385 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:19:53,385 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:19:53,404 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-10-04 14:19:53,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:19:53,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:53,412 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 14:19:53,415 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:53,420 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:53,421 INFO L82 PathProgramCache]: Analyzing trace with hash 45506320, now seen corresponding path program 1 times [2018-10-04 14:19:53,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:53,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:53,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:53,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:53,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:53,616 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 14:19:53,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:53,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:53,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:19:53,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:19:53,641 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:53,643 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 5 states. [2018-10-04 14:19:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:55,366 INFO L93 Difference]: Finished difference Result 142 states and 303 transitions. [2018-10-04 14:19:55,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:19:55,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 14:19:55,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:55,387 INFO L225 Difference]: With dead ends: 142 [2018-10-04 14:19:55,388 INFO L226 Difference]: Without dead ends: 138 [2018-10-04 14:19:55,391 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 14:19:55,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-04 14:19:55,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2018-10-04 14:19:55,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-04 14:19:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 219 transitions. [2018-10-04 14:19:55,448 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 219 transitions. Word has length 5 [2018-10-04 14:19:55,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:55,450 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 219 transitions. [2018-10-04 14:19:55,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:19:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 219 transitions. [2018-10-04 14:19:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:19:55,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:55,452 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 14:19:55,453 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:55,453 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:55,453 INFO L82 PathProgramCache]: Analyzing trace with hash 45756290, now seen corresponding path program 1 times [2018-10-04 14:19:55,454 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:55,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:55,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:55,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:55,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:55,593 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 14:19:55,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:55,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:55,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:19:55,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:19:55,596 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:55,597 INFO L87 Difference]: Start difference. First operand 98 states and 219 transitions. Second operand 5 states. [2018-10-04 14:19:57,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:57,329 INFO L93 Difference]: Finished difference Result 241 states and 539 transitions. [2018-10-04 14:19:57,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:19:57,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 14:19:57,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:57,335 INFO L225 Difference]: With dead ends: 241 [2018-10-04 14:19:57,335 INFO L226 Difference]: Without dead ends: 237 [2018-10-04 14:19:57,337 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 14:19:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-04 14:19:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 134. [2018-10-04 14:19:57,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-04 14:19:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2018-10-04 14:19:57,383 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 5 [2018-10-04 14:19:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:57,383 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2018-10-04 14:19:57,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:19:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2018-10-04 14:19:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:19:57,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:57,385 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 14:19:57,386 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:57,386 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:57,386 INFO L82 PathProgramCache]: Analyzing trace with hash 28948051, now seen corresponding path program 1 times [2018-10-04 14:19:57,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:57,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:57,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:57,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:57,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:57,469 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 14:19:57,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:57,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:57,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:19:57,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:19:57,471 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:57,471 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 5 states. [2018-10-04 14:19:59,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:59,355 INFO L93 Difference]: Finished difference Result 269 states and 639 transitions. [2018-10-04 14:19:59,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:19:59,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 14:19:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:59,365 INFO L225 Difference]: With dead ends: 269 [2018-10-04 14:19:59,366 INFO L226 Difference]: Without dead ends: 265 [2018-10-04 14:19:59,366 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 14:19:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-04 14:19:59,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 162. [2018-10-04 14:19:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-04 14:19:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 455 transitions. [2018-10-04 14:19:59,421 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 455 transitions. Word has length 5 [2018-10-04 14:19:59,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:59,421 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 455 transitions. [2018-10-04 14:19:59,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:19:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 455 transitions. [2018-10-04 14:19:59,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:19:59,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:59,424 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:59,431 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:59,431 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:59,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558066, now seen corresponding path program 1 times [2018-10-04 14:19:59,431 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:59,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:59,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:59,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:59,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:59,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 14:19:59,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:59,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:19:59,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:19:59,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:19:59,559 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:59,560 INFO L87 Difference]: Start difference. First operand 162 states and 455 transitions. Second operand 8 states. [2018-10-04 14:20:03,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:03,950 INFO L93 Difference]: Finished difference Result 790 states and 2085 transitions. [2018-10-04 14:20:03,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:20:03,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:20:03,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:03,964 INFO L225 Difference]: With dead ends: 790 [2018-10-04 14:20:03,964 INFO L226 Difference]: Without dead ends: 629 [2018-10-04 14:20:03,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 10 [2018-10-04 14:20:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-04 14:20:04,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 278. [2018-10-04 14:20:04,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-04 14:20:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 854 transitions. [2018-10-04 14:20:04,043 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 854 transitions. Word has length 8 [2018-10-04 14:20:04,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:04,044 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 854 transitions. [2018-10-04 14:20:04,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 854 transitions. [2018-10-04 14:20:04,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:04,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:04,046 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:04,047 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:04,047 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:04,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558063, now seen corresponding path program 1 times [2018-10-04 14:20:04,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:04,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:04,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:04,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:04,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:04,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:04,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:20:04,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:04,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:04,293 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:04,293 INFO L87 Difference]: Start difference. First operand 278 states and 854 transitions. Second operand 8 states. [2018-10-04 14:20:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:07,755 INFO L93 Difference]: Finished difference Result 634 states and 1540 transitions. [2018-10-04 14:20:07,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:20:07,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:20:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:07,761 INFO L225 Difference]: With dead ends: 634 [2018-10-04 14:20:07,762 INFO L226 Difference]: Without dead ends: 628 [2018-10-04 14:20:07,762 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 14:20:07,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-10-04 14:20:07,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 310. [2018-10-04 14:20:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-04 14:20:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 963 transitions. [2018-10-04 14:20:07,845 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 963 transitions. Word has length 8 [2018-10-04 14:20:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:07,845 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 963 transitions. [2018-10-04 14:20:07,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 963 transitions. [2018-10-04 14:20:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:07,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:07,848 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:07,849 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:07,849 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:07,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1080099218, now seen corresponding path program 1 times [2018-10-04 14:20:07,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:07,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:07,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:07,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:07,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:07,933 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 14:20:07,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:07,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:20:07,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:07,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:07,934 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:07,935 INFO L87 Difference]: Start difference. First operand 310 states and 963 transitions. Second operand 8 states. [2018-10-04 14:20:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:12,394 INFO L93 Difference]: Finished difference Result 768 states and 2087 transitions. [2018-10-04 14:20:12,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:20:12,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:20:12,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:12,401 INFO L225 Difference]: With dead ends: 768 [2018-10-04 14:20:12,401 INFO L226 Difference]: Without dead ends: 537 [2018-10-04 14:20:12,403 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 14:20:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-10-04 14:20:12,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 334. [2018-10-04 14:20:12,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-04 14:20:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1037 transitions. [2018-10-04 14:20:12,466 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1037 transitions. Word has length 8 [2018-10-04 14:20:12,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:12,466 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1037 transitions. [2018-10-04 14:20:12,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1037 transitions. [2018-10-04 14:20:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:12,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:12,468 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:12,469 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:12,469 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:12,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595081, now seen corresponding path program 1 times [2018-10-04 14:20:12,470 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:12,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:12,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:12,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:12,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:12,600 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 14:20:12,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:12,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:20:12,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:12,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:12,601 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:12,601 INFO L87 Difference]: Start difference. First operand 334 states and 1037 transitions. Second operand 8 states. [2018-10-04 14:20:15,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:15,367 INFO L93 Difference]: Finished difference Result 1145 states and 3146 transitions. [2018-10-04 14:20:15,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:20:15,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:20:15,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:15,379 INFO L225 Difference]: With dead ends: 1145 [2018-10-04 14:20:15,380 INFO L226 Difference]: Without dead ends: 812 [2018-10-04 14:20:15,381 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 14:20:15,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-10-04 14:20:15,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 450. [2018-10-04 14:20:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-10-04 14:20:15,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1432 transitions. [2018-10-04 14:20:15,483 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1432 transitions. Word has length 8 [2018-10-04 14:20:15,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:15,484 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1432 transitions. [2018-10-04 14:20:15,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:15,484 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1432 transitions. [2018-10-04 14:20:15,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:15,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:15,486 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:15,487 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:15,487 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:15,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595078, now seen corresponding path program 1 times [2018-10-04 14:20:15,487 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:15,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:15,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:15,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:15,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:15,645 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 14:20:15,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:15,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:20:15,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:15,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:15,647 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:15,647 INFO L87 Difference]: Start difference. First operand 450 states and 1432 transitions. Second operand 8 states. [2018-10-04 14:20:17,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:17,679 INFO L93 Difference]: Finished difference Result 877 states and 2260 transitions. [2018-10-04 14:20:17,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:20:17,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:20:17,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:17,686 INFO L225 Difference]: With dead ends: 877 [2018-10-04 14:20:17,686 INFO L226 Difference]: Without dead ends: 871 [2018-10-04 14:20:17,687 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 10 [2018-10-04 14:20:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-10-04 14:20:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 478. [2018-10-04 14:20:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-10-04 14:20:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1531 transitions. [2018-10-04 14:20:17,806 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1531 transitions. Word has length 8 [2018-10-04 14:20:17,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:17,806 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 1531 transitions. [2018-10-04 14:20:17,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:17,807 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1531 transitions. [2018-10-04 14:20:17,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:17,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:17,808 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:17,809 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:17,809 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:17,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064444, now seen corresponding path program 1 times [2018-10-04 14:20:17,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:17,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:17,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:17,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:17,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:17,917 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 14:20:17,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:17,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:20:17,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:17,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:17,918 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:17,918 INFO L87 Difference]: Start difference. First operand 478 states and 1531 transitions. Second operand 8 states. [2018-10-04 14:20:20,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:20,187 INFO L93 Difference]: Finished difference Result 1049 states and 2854 transitions. [2018-10-04 14:20:20,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:20:20,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:20:20,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:20,193 INFO L225 Difference]: With dead ends: 1049 [2018-10-04 14:20:20,193 INFO L226 Difference]: Without dead ends: 818 [2018-10-04 14:20:20,194 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 14:20:20,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-10-04 14:20:20,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 524. [2018-10-04 14:20:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-04 14:20:20,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1684 transitions. [2018-10-04 14:20:20,342 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1684 transitions. Word has length 8 [2018-10-04 14:20:20,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:20,342 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 1684 transitions. [2018-10-04 14:20:20,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:20,342 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1684 transitions. [2018-10-04 14:20:20,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:20,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:20,343 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:20,344 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:20,344 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:20,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064441, now seen corresponding path program 1 times [2018-10-04 14:20:20,345 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:20,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:20,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:20,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:20,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:20,435 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 14:20:20,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:20,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:20:20,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:20,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:20,436 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:20,436 INFO L87 Difference]: Start difference. First operand 524 states and 1684 transitions. Second operand 8 states. [2018-10-04 14:20:22,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:22,196 INFO L93 Difference]: Finished difference Result 733 states and 1997 transitions. [2018-10-04 14:20:22,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:20:22,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:20:22,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:22,203 INFO L225 Difference]: With dead ends: 733 [2018-10-04 14:20:22,203 INFO L226 Difference]: Without dead ends: 727 [2018-10-04 14:20:22,203 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 14:20:22,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-10-04 14:20:22,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 530. [2018-10-04 14:20:22,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-10-04 14:20:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1690 transitions. [2018-10-04 14:20:22,363 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1690 transitions. Word has length 8 [2018-10-04 14:20:22,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:22,364 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1690 transitions. [2018-10-04 14:20:22,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:22,364 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1690 transitions. [2018-10-04 14:20:22,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:22,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:22,365 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:22,366 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:22,366 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:22,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656691, now seen corresponding path program 1 times [2018-10-04 14:20:22,366 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:22,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:22,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:22,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:22,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:22,650 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 14:20:22,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:22,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:20:22,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:22,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:22,651 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:22,652 INFO L87 Difference]: Start difference. First operand 530 states and 1690 transitions. Second operand 8 states. [2018-10-04 14:20:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:26,132 INFO L93 Difference]: Finished difference Result 1329 states and 3609 transitions. [2018-10-04 14:20:26,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 14:20:26,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:20:26,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:26,141 INFO L225 Difference]: With dead ends: 1329 [2018-10-04 14:20:26,142 INFO L226 Difference]: Without dead ends: 1323 [2018-10-04 14:20:26,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 24 [2018-10-04 14:20:26,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-10-04 14:20:26,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 626. [2018-10-04 14:20:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-10-04 14:20:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 2087 transitions. [2018-10-04 14:20:26,386 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 2087 transitions. Word has length 8 [2018-10-04 14:20:26,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:26,387 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 2087 transitions. [2018-10-04 14:20:26,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:26,387 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 2087 transitions. [2018-10-04 14:20:26,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:26,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:26,388 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:26,389 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:26,389 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:26,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656688, now seen corresponding path program 1 times [2018-10-04 14:20:26,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:26,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:26,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:26,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:26,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:26,499 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 14:20:26,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:26,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:20:26,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:26,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:26,501 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:26,501 INFO L87 Difference]: Start difference. First operand 626 states and 2087 transitions. Second operand 8 states. [2018-10-04 14:20:28,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:28,850 INFO L93 Difference]: Finished difference Result 1268 states and 3539 transitions. [2018-10-04 14:20:28,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:20:28,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:20:28,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:28,856 INFO L225 Difference]: With dead ends: 1268 [2018-10-04 14:20:28,857 INFO L226 Difference]: Without dead ends: 1262 [2018-10-04 14:20:28,857 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 14:20:28,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-10-04 14:20:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 618. [2018-10-04 14:20:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-04 14:20:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2056 transitions. [2018-10-04 14:20:29,069 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2056 transitions. Word has length 8 [2018-10-04 14:20:29,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:29,069 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 2056 transitions. [2018-10-04 14:20:29,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2056 transitions. [2018-10-04 14:20:29,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:29,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:29,071 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:29,072 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:29,072 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:29,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285639, now seen corresponding path program 1 times [2018-10-04 14:20:29,072 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:29,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:29,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:29,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:29,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:29,230 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 14:20:29,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:29,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:20:29,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:29,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:29,231 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:29,232 INFO L87 Difference]: Start difference. First operand 618 states and 2056 transitions. Second operand 8 states. [2018-10-04 14:20:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:31,824 INFO L93 Difference]: Finished difference Result 1367 states and 3876 transitions. [2018-10-04 14:20:31,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:20:31,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:20:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:31,832 INFO L225 Difference]: With dead ends: 1367 [2018-10-04 14:20:31,832 INFO L226 Difference]: Without dead ends: 1361 [2018-10-04 14:20:31,832 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 14:20:31,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-10-04 14:20:32,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 671. [2018-10-04 14:20:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-10-04 14:20:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2249 transitions. [2018-10-04 14:20:32,033 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2249 transitions. Word has length 8 [2018-10-04 14:20:32,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:32,033 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 2249 transitions. [2018-10-04 14:20:32,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:32,033 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2249 transitions. [2018-10-04 14:20:32,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:32,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:32,034 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:32,034 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:32,035 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:32,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285636, now seen corresponding path program 1 times [2018-10-04 14:20:32,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:32,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:32,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:32,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:32,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:32,124 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 14:20:32,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:32,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:20:32,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:32,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:32,126 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:32,126 INFO L87 Difference]: Start difference. First operand 671 states and 2249 transitions. Second operand 8 states. [2018-10-04 14:20:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:35,320 INFO L93 Difference]: Finished difference Result 1373 states and 3787 transitions. [2018-10-04 14:20:35,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:20:35,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:20:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:35,330 INFO L225 Difference]: With dead ends: 1373 [2018-10-04 14:20:35,330 INFO L226 Difference]: Without dead ends: 1367 [2018-10-04 14:20:35,331 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 14:20:35,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-10-04 14:20:35,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 698. [2018-10-04 14:20:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-10-04 14:20:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2344 transitions. [2018-10-04 14:20:35,564 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2344 transitions. Word has length 8 [2018-10-04 14:20:35,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:35,564 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 2344 transitions. [2018-10-04 14:20:35,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:35,564 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2344 transitions. [2018-10-04 14:20:35,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:35,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:35,566 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:35,566 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:35,567 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:35,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280348, now seen corresponding path program 1 times [2018-10-04 14:20:35,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:35,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:35,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:35,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:35,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:35,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:35,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:35,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 14:20:35,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:35,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:35,670 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:35,670 INFO L87 Difference]: Start difference. First operand 698 states and 2344 transitions. Second operand 7 states. [2018-10-04 14:20:38,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:38,039 INFO L93 Difference]: Finished difference Result 1526 states and 4298 transitions. [2018-10-04 14:20:38,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:20:38,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:20:38,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:38,047 INFO L225 Difference]: With dead ends: 1526 [2018-10-04 14:20:38,047 INFO L226 Difference]: Without dead ends: 1520 [2018-10-04 14:20:38,048 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 13 [2018-10-04 14:20:38,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-10-04 14:20:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 789. [2018-10-04 14:20:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-10-04 14:20:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2673 transitions. [2018-10-04 14:20:38,298 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2673 transitions. Word has length 8 [2018-10-04 14:20:38,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:38,298 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 2673 transitions. [2018-10-04 14:20:38,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2673 transitions. [2018-10-04 14:20:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:38,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:38,300 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:38,300 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:38,301 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:38,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280221, now seen corresponding path program 1 times [2018-10-04 14:20:38,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:38,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:38,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:38,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:38,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:38,385 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 14:20:38,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:38,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 14:20:38,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:38,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:38,386 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:38,387 INFO L87 Difference]: Start difference. First operand 789 states and 2673 transitions. Second operand 7 states. [2018-10-04 14:20:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:41,000 INFO L93 Difference]: Finished difference Result 1548 states and 4356 transitions. [2018-10-04 14:20:41,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:20:41,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:20:41,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:41,008 INFO L225 Difference]: With dead ends: 1548 [2018-10-04 14:20:41,008 INFO L226 Difference]: Without dead ends: 1542 [2018-10-04 14:20:41,008 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 14:20:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-10-04 14:20:41,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 821. [2018-10-04 14:20:41,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-04 14:20:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2801 transitions. [2018-10-04 14:20:41,318 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2801 transitions. Word has length 8 [2018-10-04 14:20:41,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:41,319 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 2801 transitions. [2018-10-04 14:20:41,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:41,319 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2801 transitions. [2018-10-04 14:20:41,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:41,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:41,320 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:41,321 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:41,321 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:41,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878937, now seen corresponding path program 1 times [2018-10-04 14:20:41,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:41,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:41,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:41,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:41,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:41,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:41,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 14:20:41,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:41,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:41,411 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:41,411 INFO L87 Difference]: Start difference. First operand 821 states and 2801 transitions. Second operand 7 states. [2018-10-04 14:20:44,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:44,060 INFO L93 Difference]: Finished difference Result 1575 states and 4539 transitions. [2018-10-04 14:20:44,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:20:44,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:20:44,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:44,068 INFO L225 Difference]: With dead ends: 1575 [2018-10-04 14:20:44,069 INFO L226 Difference]: Without dead ends: 1569 [2018-10-04 14:20:44,069 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 14:20:44,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-10-04 14:20:44,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 849. [2018-10-04 14:20:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-10-04 14:20:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2913 transitions. [2018-10-04 14:20:44,367 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2913 transitions. Word has length 8 [2018-10-04 14:20:44,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:44,367 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 2913 transitions. [2018-10-04 14:20:44,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:44,367 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2913 transitions. [2018-10-04 14:20:44,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:44,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:44,369 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:44,369 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:44,369 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:44,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878810, now seen corresponding path program 1 times [2018-10-04 14:20:44,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:44,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:44,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:44,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:44,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:44,448 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 14:20:44,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:44,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 14:20:44,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:44,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:44,449 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:44,449 INFO L87 Difference]: Start difference. First operand 849 states and 2913 transitions. Second operand 7 states. [2018-10-04 14:20:46,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:46,946 INFO L93 Difference]: Finished difference Result 1597 states and 4579 transitions. [2018-10-04 14:20:46,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:20:46,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:20:46,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:46,957 INFO L225 Difference]: With dead ends: 1597 [2018-10-04 14:20:46,957 INFO L226 Difference]: Without dead ends: 1591 [2018-10-04 14:20:46,958 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 14:20:46,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-10-04 14:20:47,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 873. [2018-10-04 14:20:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-10-04 14:20:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2993 transitions. [2018-10-04 14:20:47,299 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2993 transitions. Word has length 8 [2018-10-04 14:20:47,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:47,300 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 2993 transitions. [2018-10-04 14:20:47,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:47,300 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2993 transitions. [2018-10-04 14:20:47,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:47,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:47,301 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:47,302 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:47,302 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:47,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288024, now seen corresponding path program 1 times [2018-10-04 14:20:47,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:47,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:47,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:47,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:47,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:47,465 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 14:20:47,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:47,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 14:20:47,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:47,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:47,467 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:47,467 INFO L87 Difference]: Start difference. First operand 873 states and 2993 transitions. Second operand 7 states. [2018-10-04 14:20:49,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:49,729 INFO L93 Difference]: Finished difference Result 1726 states and 5211 transitions. [2018-10-04 14:20:49,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:20:49,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:20:49,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:49,739 INFO L225 Difference]: With dead ends: 1726 [2018-10-04 14:20:49,739 INFO L226 Difference]: Without dead ends: 1720 [2018-10-04 14:20:49,740 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 14:20:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2018-10-04 14:20:50,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1006. [2018-10-04 14:20:50,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-10-04 14:20:50,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3474 transitions. [2018-10-04 14:20:50,158 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3474 transitions. Word has length 8 [2018-10-04 14:20:50,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:50,159 INFO L480 AbstractCegarLoop]: Abstraction has 1006 states and 3474 transitions. [2018-10-04 14:20:50,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3474 transitions. [2018-10-04 14:20:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:50,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:50,160 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:50,160 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:50,160 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:50,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288027, now seen corresponding path program 1 times [2018-10-04 14:20:50,161 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:50,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:50,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:50,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:50,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:50,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:50,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 14:20:50,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:50,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:50,259 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:50,259 INFO L87 Difference]: Start difference. First operand 1006 states and 3474 transitions. Second operand 7 states. [2018-10-04 14:20:53,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:53,437 INFO L93 Difference]: Finished difference Result 1758 states and 5203 transitions. [2018-10-04 14:20:53,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:20:53,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:20:53,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:53,443 INFO L225 Difference]: With dead ends: 1758 [2018-10-04 14:20:53,444 INFO L226 Difference]: Without dead ends: 1752 [2018-10-04 14:20:53,444 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 14:20:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-10-04 14:20:53,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1011. [2018-10-04 14:20:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-10-04 14:20:53,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3493 transitions. [2018-10-04 14:20:53,921 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3493 transitions. Word has length 8 [2018-10-04 14:20:53,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:53,921 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 3493 transitions. [2018-10-04 14:20:53,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:53,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3493 transitions. [2018-10-04 14:20:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:53,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:53,922 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:53,922 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:53,923 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:53,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746872, now seen corresponding path program 1 times [2018-10-04 14:20:53,923 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:53,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:53,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:53,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:53,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:54,046 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 14:20:54,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:54,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 14:20:54,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:54,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:54,048 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:54,048 INFO L87 Difference]: Start difference. First operand 1011 states and 3493 transitions. Second operand 7 states. [2018-10-04 14:20:57,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:57,243 INFO L93 Difference]: Finished difference Result 1867 states and 5608 transitions. [2018-10-04 14:20:57,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:20:57,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:20:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:57,254 INFO L225 Difference]: With dead ends: 1867 [2018-10-04 14:20:57,254 INFO L226 Difference]: Without dead ends: 1861 [2018-10-04 14:20:57,255 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 13 [2018-10-04 14:20:57,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2018-10-04 14:20:57,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1119. [2018-10-04 14:20:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-10-04 14:20:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3931 transitions. [2018-10-04 14:20:57,774 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3931 transitions. Word has length 8 [2018-10-04 14:20:57,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:57,774 INFO L480 AbstractCegarLoop]: Abstraction has 1119 states and 3931 transitions. [2018-10-04 14:20:57,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:20:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3931 transitions. [2018-10-04 14:20:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:20:57,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:57,775 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:57,776 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:57,776 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:57,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746875, now seen corresponding path program 1 times [2018-10-04 14:20:57,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:57,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:57,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:57,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:57,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:57,983 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 14:20:57,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:57,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 14:20:57,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:20:57,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:20:57,985 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:57,985 INFO L87 Difference]: Start difference. First operand 1119 states and 3931 transitions. Second operand 7 states. [2018-10-04 14:21:01,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:01,591 INFO L93 Difference]: Finished difference Result 1968 states and 5829 transitions. [2018-10-04 14:21:01,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:21:01,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:21:01,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:01,598 INFO L225 Difference]: With dead ends: 1968 [2018-10-04 14:21:01,598 INFO L226 Difference]: Without dead ends: 1962 [2018-10-04 14:21:01,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 13 [2018-10-04 14:21:01,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-10-04 14:21:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1111. [2018-10-04 14:21:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-10-04 14:21:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3891 transitions. [2018-10-04 14:21:02,278 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3891 transitions. Word has length 8 [2018-10-04 14:21:02,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:02,278 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 3891 transitions. [2018-10-04 14:21:02,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:21:02,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3891 transitions. [2018-10-04 14:21:02,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:21:02,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:02,279 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:02,280 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:02,280 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:02,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1616407055, now seen corresponding path program 1 times [2018-10-04 14:21:02,280 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:02,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:02,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:02,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:02,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:02,350 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 14:21:02,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:02,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 14:21:02,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:21:02,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:21:02,351 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:02,351 INFO L87 Difference]: Start difference. First operand 1111 states and 3891 transitions. Second operand 7 states. [2018-10-04 14:21:05,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:05,455 INFO L93 Difference]: Finished difference Result 2001 states and 6001 transitions. [2018-10-04 14:21:05,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:21:05,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:21:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:05,462 INFO L225 Difference]: With dead ends: 2001 [2018-10-04 14:21:05,462 INFO L226 Difference]: Without dead ends: 1995 [2018-10-04 14:21:05,463 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 14:21:05,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-10-04 14:21:06,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1117. [2018-10-04 14:21:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-10-04 14:21:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 3909 transitions. [2018-10-04 14:21:06,130 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 3909 transitions. Word has length 8 [2018-10-04 14:21:06,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:06,130 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 3909 transitions. [2018-10-04 14:21:06,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:21:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 3909 transitions. [2018-10-04 14:21:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:21:06,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:06,131 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:06,133 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:06,133 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:06,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1616406928, now seen corresponding path program 1 times [2018-10-04 14:21:06,133 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:06,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:06,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:06,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:06,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:06,194 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 14:21:06,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:06,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 14:21:06,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:21:06,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:21:06,195 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:06,195 INFO L87 Difference]: Start difference. First operand 1117 states and 3909 transitions. Second operand 7 states. [2018-10-04 14:21:08,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:08,820 INFO L93 Difference]: Finished difference Result 1708 states and 5233 transitions. [2018-10-04 14:21:08,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:21:08,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:21:08,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:08,826 INFO L225 Difference]: With dead ends: 1708 [2018-10-04 14:21:08,827 INFO L226 Difference]: Without dead ends: 1702 [2018-10-04 14:21:08,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 10 [2018-10-04 14:21:08,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-10-04 14:21:09,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1210. [2018-10-04 14:21:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2018-10-04 14:21:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4307 transitions. [2018-10-04 14:21:09,496 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 4307 transitions. Word has length 8 [2018-10-04 14:21:09,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:09,496 INFO L480 AbstractCegarLoop]: Abstraction has 1210 states and 4307 transitions. [2018-10-04 14:21:09,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:21:09,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 4307 transitions. [2018-10-04 14:21:09,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:21:09,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:09,498 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:09,498 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:09,498 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:09,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256941, now seen corresponding path program 1 times [2018-10-04 14:21:09,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:09,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:09,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:09,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:09,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:09,587 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 14:21:09,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:09,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 14:21:09,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:21:09,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:21:09,588 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:09,588 INFO L87 Difference]: Start difference. First operand 1210 states and 4307 transitions. Second operand 7 states. [2018-10-04 14:21:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:13,572 INFO L93 Difference]: Finished difference Result 2402 states and 7321 transitions. [2018-10-04 14:21:13,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:21:13,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:21:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:13,578 INFO L225 Difference]: With dead ends: 2402 [2018-10-04 14:21:13,578 INFO L226 Difference]: Without dead ends: 2396 [2018-10-04 14:21:13,578 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 14:21:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-10-04 14:21:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1341. [2018-10-04 14:21:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-10-04 14:21:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4862 transitions. [2018-10-04 14:21:14,305 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4862 transitions. Word has length 8 [2018-10-04 14:21:14,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:14,305 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4862 transitions. [2018-10-04 14:21:14,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:21:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4862 transitions. [2018-10-04 14:21:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:21:14,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:14,307 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:14,307 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:14,307 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:14,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256944, now seen corresponding path program 1 times [2018-10-04 14:21:14,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:14,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:14,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:14,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:14,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:14,815 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 14:21:14,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:14,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 14:21:14,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:21:14,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:21:14,816 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:14,817 INFO L87 Difference]: Start difference. First operand 1341 states and 4862 transitions. Second operand 7 states. [2018-10-04 14:21:18,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:18,825 INFO L93 Difference]: Finished difference Result 2274 states and 6934 transitions. [2018-10-04 14:21:18,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:21:18,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-04 14:21:18,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:18,829 INFO L225 Difference]: With dead ends: 2274 [2018-10-04 14:21:18,829 INFO L226 Difference]: Without dead ends: 2268 [2018-10-04 14:21:18,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 15 [2018-10-04 14:21:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2018-10-04 14:21:19,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1337. [2018-10-04 14:21:19,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-10-04 14:21:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 4840 transitions. [2018-10-04 14:21:19,600 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 4840 transitions. Word has length 8 [2018-10-04 14:21:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:19,600 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 4840 transitions. [2018-10-04 14:21:19,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:21:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 4840 transitions. [2018-10-04 14:21:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:21:19,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:19,601 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-04 14:21:19,602 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:19,602 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:19,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1621267991, now seen corresponding path program 1 times [2018-10-04 14:21:19,602 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:19,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:19,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:19,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:19,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:19,642 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 14:21:19,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:19,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:21:19,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:21:19,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:21:19,643 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:19,644 INFO L87 Difference]: Start difference. First operand 1337 states and 4840 transitions. Second operand 4 states. [2018-10-04 14:21:20,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:20,587 INFO L93 Difference]: Finished difference Result 2170 states and 7637 transitions. [2018-10-04 14:21:20,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:21:20,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-04 14:21:20,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:20,589 INFO L225 Difference]: With dead ends: 2170 [2018-10-04 14:21:20,590 INFO L226 Difference]: Without dead ends: 1253 [2018-10-04 14:21:20,591 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 14:21:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-10-04 14:21:21,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1080. [2018-10-04 14:21:21,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-10-04 14:21:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3769 transitions. [2018-10-04 14:21:21,286 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3769 transitions. Word has length 8 [2018-10-04 14:21:21,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:21,286 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 3769 transitions. [2018-10-04 14:21:21,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:21:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3769 transitions. [2018-10-04 14:21:21,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:21:21,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:21,288 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:21,288 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:21,288 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:21,289 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283460, now seen corresponding path program 1 times [2018-10-04 14:21:21,289 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:21,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:21,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:21,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:21,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:21,378 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 14:21:21,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:21,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:21:21,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:21:21,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:21:21,379 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:21,379 INFO L87 Difference]: Start difference. First operand 1080 states and 3769 transitions. Second operand 8 states. [2018-10-04 14:21:25,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:25,574 INFO L93 Difference]: Finished difference Result 2095 states and 6316 transitions. [2018-10-04 14:21:25,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:21:25,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:21:25,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:25,579 INFO L225 Difference]: With dead ends: 2095 [2018-10-04 14:21:25,579 INFO L226 Difference]: Without dead ends: 2093 [2018-10-04 14:21:25,580 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 14:21:25,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-10-04 14:21:26,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1161. [2018-10-04 14:21:26,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2018-10-04 14:21:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 4123 transitions. [2018-10-04 14:21:26,269 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 4123 transitions. Word has length 8 [2018-10-04 14:21:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:26,269 INFO L480 AbstractCegarLoop]: Abstraction has 1161 states and 4123 transitions. [2018-10-04 14:21:26,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:21:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 4123 transitions. [2018-10-04 14:21:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:21:26,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:26,270 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:26,271 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:26,271 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:26,271 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283333, now seen corresponding path program 1 times [2018-10-04 14:21:26,271 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:26,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:26,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:26,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:26,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:26,383 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 14:21:26,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:26,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:21:26,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:21:26,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:21:26,384 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:26,384 INFO L87 Difference]: Start difference. First operand 1161 states and 4123 transitions. Second operand 8 states. [2018-10-04 14:21:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:30,590 INFO L93 Difference]: Finished difference Result 1994 states and 5988 transitions. [2018-10-04 14:21:30,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:21:30,591 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:21:30,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:30,595 INFO L225 Difference]: With dead ends: 1994 [2018-10-04 14:21:30,595 INFO L226 Difference]: Without dead ends: 1988 [2018-10-04 14:21:30,595 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 14:21:30,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-10-04 14:21:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1152. [2018-10-04 14:21:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-10-04 14:21:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 4099 transitions. [2018-10-04 14:21:31,344 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 4099 transitions. Word has length 8 [2018-10-04 14:21:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:31,344 INFO L480 AbstractCegarLoop]: Abstraction has 1152 states and 4099 transitions. [2018-10-04 14:21:31,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:21:31,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 4099 transitions. [2018-10-04 14:21:31,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:21:31,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:31,346 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:31,346 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:31,346 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:31,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1867882049, now seen corresponding path program 1 times [2018-10-04 14:21:31,346 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:31,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:31,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:31,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:31,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:31,429 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 14:21:31,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:31,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:21:31,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:21:31,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:21:31,430 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:31,430 INFO L87 Difference]: Start difference. First operand 1152 states and 4099 transitions. Second operand 8 states. [2018-10-04 14:21:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:36,366 INFO L93 Difference]: Finished difference Result 2160 states and 6516 transitions. [2018-10-04 14:21:36,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:21:36,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:21:36,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:36,371 INFO L225 Difference]: With dead ends: 2160 [2018-10-04 14:21:36,371 INFO L226 Difference]: Without dead ends: 2154 [2018-10-04 14:21:36,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 15 [2018-10-04 14:21:36,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2018-10-04 14:21:37,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1174. [2018-10-04 14:21:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-10-04 14:21:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4164 transitions. [2018-10-04 14:21:37,223 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 4164 transitions. Word has length 8 [2018-10-04 14:21:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:37,223 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 4164 transitions. [2018-10-04 14:21:37,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:21:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 4164 transitions. [2018-10-04 14:21:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:21:37,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:37,224 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:37,224 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:37,224 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:37,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1867881922, now seen corresponding path program 1 times [2018-10-04 14:21:37,225 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:37,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:37,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:37,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:37,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:37,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 14:21:37,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:37,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:21:37,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:21:37,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:21:37,328 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:37,328 INFO L87 Difference]: Start difference. First operand 1174 states and 4164 transitions. Second operand 8 states. [2018-10-04 14:21:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:42,201 INFO L93 Difference]: Finished difference Result 2094 states and 6271 transitions. [2018-10-04 14:21:42,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:21:42,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:21:42,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:42,206 INFO L225 Difference]: With dead ends: 2094 [2018-10-04 14:21:42,206 INFO L226 Difference]: Without dead ends: 2088 [2018-10-04 14:21:42,207 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 15 [2018-10-04 14:21:42,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2018-10-04 14:21:43,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1153. [2018-10-04 14:21:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-10-04 14:21:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 4095 transitions. [2018-10-04 14:21:43,024 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 4095 transitions. Word has length 8 [2018-10-04 14:21:43,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:43,024 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 4095 transitions. [2018-10-04 14:21:43,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:21:43,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 4095 transitions. [2018-10-04 14:21:43,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:21:43,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:43,025 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-04 14:21:43,026 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:43,026 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:43,026 INFO L82 PathProgramCache]: Analyzing trace with hash -896988374, now seen corresponding path program 1 times [2018-10-04 14:21:43,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:43,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:43,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:43,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:43,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:43,083 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 14:21:43,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:43,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:21:43,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:21:43,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:21:43,084 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:43,084 INFO L87 Difference]: Start difference. First operand 1153 states and 4095 transitions. Second operand 4 states. [2018-10-04 14:21:44,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:44,378 INFO L93 Difference]: Finished difference Result 1929 states and 6604 transitions. [2018-10-04 14:21:44,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:21:44,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-04 14:21:44,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:44,382 INFO L225 Difference]: With dead ends: 1929 [2018-10-04 14:21:44,382 INFO L226 Difference]: Without dead ends: 1400 [2018-10-04 14:21:44,383 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 14:21:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2018-10-04 14:21:45,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1083. [2018-10-04 14:21:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2018-10-04 14:21:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3765 transitions. [2018-10-04 14:21:45,357 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 3765 transitions. Word has length 8 [2018-10-04 14:21:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:45,357 INFO L480 AbstractCegarLoop]: Abstraction has 1083 states and 3765 transitions. [2018-10-04 14:21:45,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:21:45,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 3765 transitions. [2018-10-04 14:21:45,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:21:45,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:45,358 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:45,358 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:45,358 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:45,359 INFO L82 PathProgramCache]: Analyzing trace with hash -896379114, now seen corresponding path program 1 times [2018-10-04 14:21:45,359 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:45,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:45,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:45,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:45,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:45,449 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 14:21:45,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:45,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:21:45,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:21:45,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:21:45,451 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:45,451 INFO L87 Difference]: Start difference. First operand 1083 states and 3765 transitions. Second operand 8 states. [2018-10-04 14:21:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:49,922 INFO L93 Difference]: Finished difference Result 2276 states and 6948 transitions. [2018-10-04 14:21:49,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:21:49,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:21:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:49,928 INFO L225 Difference]: With dead ends: 2276 [2018-10-04 14:21:49,928 INFO L226 Difference]: Without dead ends: 2270 [2018-10-04 14:21:49,929 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 13 [2018-10-04 14:21:49,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2018-10-04 14:21:50,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1266. [2018-10-04 14:21:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2018-10-04 14:21:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4418 transitions. [2018-10-04 14:21:50,940 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 4418 transitions. Word has length 8 [2018-10-04 14:21:50,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:50,940 INFO L480 AbstractCegarLoop]: Abstraction has 1266 states and 4418 transitions. [2018-10-04 14:21:50,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:21:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 4418 transitions. [2018-10-04 14:21:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:21:50,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:50,941 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:50,942 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:50,942 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:50,942 INFO L82 PathProgramCache]: Analyzing trace with hash -896379111, now seen corresponding path program 1 times [2018-10-04 14:21:50,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:50,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:50,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:50,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:50,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:51,029 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 14:21:51,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:51,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:21:51,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:21:51,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:21:51,030 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:51,031 INFO L87 Difference]: Start difference. First operand 1266 states and 4418 transitions. Second operand 8 states. [2018-10-04 14:21:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:56,112 INFO L93 Difference]: Finished difference Result 2425 states and 7363 transitions. [2018-10-04 14:21:56,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:21:56,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:21:56,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:56,117 INFO L225 Difference]: With dead ends: 2425 [2018-10-04 14:21:56,117 INFO L226 Difference]: Without dead ends: 2419 [2018-10-04 14:21:56,118 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 14 [2018-10-04 14:21:56,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2018-10-04 14:21:57,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1373. [2018-10-04 14:21:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2018-10-04 14:21:57,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 4822 transitions. [2018-10-04 14:21:57,367 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 4822 transitions. Word has length 8 [2018-10-04 14:21:57,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:57,367 INFO L480 AbstractCegarLoop]: Abstraction has 1373 states and 4822 transitions. [2018-10-04 14:21:57,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:21:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 4822 transitions. [2018-10-04 14:21:57,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:21:57,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:57,369 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:57,369 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:57,369 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:57,369 INFO L82 PathProgramCache]: Analyzing trace with hash -881085998, now seen corresponding path program 1 times [2018-10-04 14:21:57,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:57,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:57,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:57,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:57,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:57,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:57,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:21:57,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:21:57,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:21:57,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:21:57,444 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:57,444 INFO L87 Difference]: Start difference. First operand 1373 states and 4822 transitions. Second operand 8 states. [2018-10-04 14:22:02,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:02,731 INFO L93 Difference]: Finished difference Result 2278 states and 6952 transitions. [2018-10-04 14:22:02,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:22:02,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:22:02,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:02,737 INFO L225 Difference]: With dead ends: 2278 [2018-10-04 14:22:02,737 INFO L226 Difference]: Without dead ends: 2272 [2018-10-04 14:22:02,738 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 16 [2018-10-04 14:22:02,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2018-10-04 14:22:03,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1421. [2018-10-04 14:22:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2018-10-04 14:22:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 4963 transitions. [2018-10-04 14:22:04,002 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 4963 transitions. Word has length 8 [2018-10-04 14:22:04,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:04,003 INFO L480 AbstractCegarLoop]: Abstraction has 1421 states and 4963 transitions. [2018-10-04 14:22:04,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:22:04,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 4963 transitions. [2018-10-04 14:22:04,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:22:04,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:04,004 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:04,004 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:04,004 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:04,004 INFO L82 PathProgramCache]: Analyzing trace with hash -881086125, now seen corresponding path program 1 times [2018-10-04 14:22:04,004 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:04,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:04,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:04,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:04,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:04,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:22:04,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:22:04,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:22:04,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:22:04,079 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:04,079 INFO L87 Difference]: Start difference. First operand 1421 states and 4963 transitions. Second operand 8 states. [2018-10-04 14:22:09,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:09,220 INFO L93 Difference]: Finished difference Result 2233 states and 6848 transitions. [2018-10-04 14:22:09,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:22:09,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:22:09,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:09,225 INFO L225 Difference]: With dead ends: 2233 [2018-10-04 14:22:09,226 INFO L226 Difference]: Without dead ends: 2227 [2018-10-04 14:22:09,226 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 14:22:09,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2018-10-04 14:22:10,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1411. [2018-10-04 14:22:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-10-04 14:22:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 4926 transitions. [2018-10-04 14:22:10,543 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 4926 transitions. Word has length 8 [2018-10-04 14:22:10,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:10,543 INFO L480 AbstractCegarLoop]: Abstraction has 1411 states and 4926 transitions. [2018-10-04 14:22:10,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:22:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 4926 transitions. [2018-10-04 14:22:10,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:22:10,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:10,544 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:10,545 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:10,545 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:10,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099334, now seen corresponding path program 1 times [2018-10-04 14:22:10,545 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:10,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:10,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:10,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:10,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:10,765 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 14:22:10,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:22:10,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:22:10,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:22:10,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:22:10,766 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:10,766 INFO L87 Difference]: Start difference. First operand 1411 states and 4926 transitions. Second operand 8 states. [2018-10-04 14:22:16,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:16,445 INFO L93 Difference]: Finished difference Result 2558 states and 7836 transitions. [2018-10-04 14:22:16,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:22:16,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:22:16,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:16,450 INFO L225 Difference]: With dead ends: 2558 [2018-10-04 14:22:16,450 INFO L226 Difference]: Without dead ends: 2552 [2018-10-04 14:22:16,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 16 [2018-10-04 14:22:16,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-10-04 14:22:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1471. [2018-10-04 14:22:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2018-10-04 14:22:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 5183 transitions. [2018-10-04 14:22:17,767 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 5183 transitions. Word has length 8 [2018-10-04 14:22:17,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:17,768 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 5183 transitions. [2018-10-04 14:22:17,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:22:17,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 5183 transitions. [2018-10-04 14:22:17,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:22:17,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:17,769 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:17,770 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:17,770 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:17,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099337, now seen corresponding path program 1 times [2018-10-04 14:22:17,770 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:17,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:17,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:17,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:17,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:17,851 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 14:22:17,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:22:17,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:22:17,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:22:17,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:22:17,852 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:17,852 INFO L87 Difference]: Start difference. First operand 1471 states and 5183 transitions. Second operand 8 states. [2018-10-04 14:22:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:23,823 INFO L93 Difference]: Finished difference Result 2703 states and 8278 transitions. [2018-10-04 14:22:23,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:22:23,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:22:23,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:23,828 INFO L225 Difference]: With dead ends: 2703 [2018-10-04 14:22:23,828 INFO L226 Difference]: Without dead ends: 2697 [2018-10-04 14:22:23,829 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 16 [2018-10-04 14:22:23,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2018-10-04 14:22:25,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1480. [2018-10-04 14:22:25,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-10-04 14:22:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5200 transitions. [2018-10-04 14:22:25,181 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5200 transitions. Word has length 8 [2018-10-04 14:22:25,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:25,181 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5200 transitions. [2018-10-04 14:22:25,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:22:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5200 transitions. [2018-10-04 14:22:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:22:25,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:25,182 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:25,182 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:25,182 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:25,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629971, now seen corresponding path program 1 times [2018-10-04 14:22:25,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:25,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:25,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:25,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:25,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:25,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:22:25,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:22:25,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:22:25,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:22:25,292 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:25,292 INFO L87 Difference]: Start difference. First operand 1480 states and 5200 transitions. Second operand 8 states. [2018-10-04 14:22:31,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:31,750 INFO L93 Difference]: Finished difference Result 2674 states and 8171 transitions. [2018-10-04 14:22:31,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:22:31,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:22:31,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:31,755 INFO L225 Difference]: With dead ends: 2674 [2018-10-04 14:22:31,755 INFO L226 Difference]: Without dead ends: 2668 [2018-10-04 14:22:31,756 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 15 [2018-10-04 14:22:31,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2018-10-04 14:22:33,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 1480. [2018-10-04 14:22:33,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-10-04 14:22:33,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5196 transitions. [2018-10-04 14:22:33,184 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5196 transitions. Word has length 8 [2018-10-04 14:22:33,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:33,184 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5196 transitions. [2018-10-04 14:22:33,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:22:33,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5196 transitions. [2018-10-04 14:22:33,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:22:33,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:33,185 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:33,185 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:33,185 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:33,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629974, now seen corresponding path program 1 times [2018-10-04 14:22:33,186 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:33,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:33,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:33,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:33,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:33,625 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 14:22:33,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:22:33,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:22:33,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:22:33,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:22:33,626 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:33,626 INFO L87 Difference]: Start difference. First operand 1480 states and 5196 transitions. Second operand 8 states. [2018-10-04 14:22:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:40,285 INFO L93 Difference]: Finished difference Result 2722 states and 8299 transitions. [2018-10-04 14:22:40,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 14:22:40,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:22:40,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:40,292 INFO L225 Difference]: With dead ends: 2722 [2018-10-04 14:22:40,292 INFO L226 Difference]: Without dead ends: 2716 [2018-10-04 14:22:40,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 14 [2018-10-04 14:22:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2018-10-04 14:22:41,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 1462. [2018-10-04 14:22:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2018-10-04 14:22:41,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 5124 transitions. [2018-10-04 14:22:41,780 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 5124 transitions. Word has length 8 [2018-10-04 14:22:41,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:41,780 INFO L480 AbstractCegarLoop]: Abstraction has 1462 states and 5124 transitions. [2018-10-04 14:22:41,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:22:41,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 5124 transitions. [2018-10-04 14:22:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:22:41,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:41,782 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:41,782 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:41,782 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:41,782 INFO L82 PathProgramCache]: Analyzing trace with hash 278041308, now seen corresponding path program 1 times [2018-10-04 14:22:41,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:41,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:41,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:41,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:41,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:42,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:42,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:22:42,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:22:42,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:22:42,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:22:42,059 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:42,060 INFO L87 Difference]: Start difference. First operand 1462 states and 5124 transitions. Second operand 8 states. [2018-10-04 14:22:47,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:47,988 INFO L93 Difference]: Finished difference Result 2962 states and 9218 transitions. [2018-10-04 14:22:47,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:22:47,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 14:22:47,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:47,994 INFO L225 Difference]: With dead ends: 2962 [2018-10-04 14:22:47,994 INFO L226 Difference]: Without dead ends: 2956 [2018-10-04 14:22:47,995 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 14:22:47,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2018-10-04 14:22:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1776. [2018-10-04 14:22:49,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-10-04 14:22:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 6236 transitions. [2018-10-04 14:22:49,760 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 6236 transitions. Word has length 9 [2018-10-04 14:22:49,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:49,760 INFO L480 AbstractCegarLoop]: Abstraction has 1776 states and 6236 transitions. [2018-10-04 14:22:49,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:22:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 6236 transitions. [2018-10-04 14:22:49,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:22:49,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:49,761 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:49,762 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:49,762 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:49,762 INFO L82 PathProgramCache]: Analyzing trace with hash 278041683, now seen corresponding path program 1 times [2018-10-04 14:22:49,762 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:49,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:49,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:49,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:49,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:49,828 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 14:22:49,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:22:49,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:22:49,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:22:49,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:22:49,830 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:49,830 INFO L87 Difference]: Start difference. First operand 1776 states and 6236 transitions. Second operand 8 states. [2018-10-04 14:22:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:55,877 INFO L93 Difference]: Finished difference Result 2948 states and 9162 transitions. [2018-10-04 14:22:55,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:22:55,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 14:22:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:55,883 INFO L225 Difference]: With dead ends: 2948 [2018-10-04 14:22:55,884 INFO L226 Difference]: Without dead ends: 2942 [2018-10-04 14:22:55,884 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 14:22:55,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2018-10-04 14:22:57,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1772. [2018-10-04 14:22:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-10-04 14:22:57,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 6220 transitions. [2018-10-04 14:22:57,711 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 6220 transitions. Word has length 9 [2018-10-04 14:22:57,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:57,711 INFO L480 AbstractCegarLoop]: Abstraction has 1772 states and 6220 transitions. [2018-10-04 14:22:57,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:22:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 6220 transitions. [2018-10-04 14:22:57,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:22:57,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:57,713 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:57,713 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:57,713 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:57,713 INFO L82 PathProgramCache]: Analyzing trace with hash 541105076, now seen corresponding path program 1 times [2018-10-04 14:22:57,713 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:57,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:57,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:57,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:57,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:57,867 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 14:22:57,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:22:57,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:22:57,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:22:57,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:22:57,868 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:57,868 INFO L87 Difference]: Start difference. First operand 1772 states and 6220 transitions. Second operand 8 states. [2018-10-04 14:23:04,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:04,908 INFO L93 Difference]: Finished difference Result 3238 states and 9970 transitions. [2018-10-04 14:23:04,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:23:04,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 14:23:04,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:04,915 INFO L225 Difference]: With dead ends: 3238 [2018-10-04 14:23:04,916 INFO L226 Difference]: Without dead ends: 3232 [2018-10-04 14:23:04,917 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 13 [2018-10-04 14:23:04,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2018-10-04 14:23:06,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1799. [2018-10-04 14:23:06,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-10-04 14:23:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 6288 transitions. [2018-10-04 14:23:06,855 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 6288 transitions. Word has length 9 [2018-10-04 14:23:06,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:06,855 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 6288 transitions. [2018-10-04 14:23:06,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:23:06,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 6288 transitions. [2018-10-04 14:23:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:23:06,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:06,856 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:23:06,856 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:06,857 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:06,857 INFO L82 PathProgramCache]: Analyzing trace with hash 541105451, now seen corresponding path program 1 times [2018-10-04 14:23:06,857 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:06,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:06,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:06,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:06,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:07,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 14:23:07,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:23:07,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:23:07,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:23:07,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:23:07,026 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:07,026 INFO L87 Difference]: Start difference. First operand 1799 states and 6288 transitions. Second operand 8 states. [2018-10-04 14:23:14,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:14,353 INFO L93 Difference]: Finished difference Result 3212 states and 9854 transitions. [2018-10-04 14:23:14,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:23:14,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 14:23:14,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:14,360 INFO L225 Difference]: With dead ends: 3212 [2018-10-04 14:23:14,360 INFO L226 Difference]: Without dead ends: 3206 [2018-10-04 14:23:14,361 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 13 [2018-10-04 14:23:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2018-10-04 14:23:16,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 1737. [2018-10-04 14:23:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2018-10-04 14:23:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 6062 transitions. [2018-10-04 14:23:16,307 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 6062 transitions. Word has length 9 [2018-10-04 14:23:16,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:16,307 INFO L480 AbstractCegarLoop]: Abstraction has 1737 states and 6062 transitions. [2018-10-04 14:23:16,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:23:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 6062 transitions. [2018-10-04 14:23:16,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:23:16,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:16,309 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:23:16,309 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:16,309 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:16,309 INFO L82 PathProgramCache]: Analyzing trace with hash 825189368, now seen corresponding path program 1 times [2018-10-04 14:23:16,309 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:16,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:16,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:16,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:16,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:16,374 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 14:23:16,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:23:16,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:23:16,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:23:16,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:23:16,375 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:16,375 INFO L87 Difference]: Start difference. First operand 1737 states and 6062 transitions. Second operand 8 states. [2018-10-04 14:23:23,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:23,140 INFO L93 Difference]: Finished difference Result 3315 states and 10043 transitions. [2018-10-04 14:23:23,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:23:23,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 14:23:23,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:23,146 INFO L225 Difference]: With dead ends: 3315 [2018-10-04 14:23:23,146 INFO L226 Difference]: Without dead ends: 3309 [2018-10-04 14:23:23,147 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 14:23:23,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2018-10-04 14:23:25,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 1985. [2018-10-04 14:23:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2018-10-04 14:23:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 6886 transitions. [2018-10-04 14:23:25,317 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 6886 transitions. Word has length 9 [2018-10-04 14:23:25,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:25,318 INFO L480 AbstractCegarLoop]: Abstraction has 1985 states and 6886 transitions. [2018-10-04 14:23:25,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:23:25,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 6886 transitions. [2018-10-04 14:23:25,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:23:25,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:25,320 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:23:25,320 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:25,320 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:25,320 INFO L82 PathProgramCache]: Analyzing trace with hash 825189371, now seen corresponding path program 1 times [2018-10-04 14:23:25,320 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:25,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:25,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:25,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:25,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:25,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 14:23:25,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:23:25,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:23:25,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:23:25,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:23:25,392 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:25,392 INFO L87 Difference]: Start difference. First operand 1985 states and 6886 transitions. Second operand 8 states. [2018-10-04 14:23:33,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:33,197 INFO L93 Difference]: Finished difference Result 3446 states and 10415 transitions. [2018-10-04 14:23:33,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:23:33,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 14:23:33,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:33,204 INFO L225 Difference]: With dead ends: 3446 [2018-10-04 14:23:33,204 INFO L226 Difference]: Without dead ends: 3440 [2018-10-04 14:23:33,205 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 17 [2018-10-04 14:23:33,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2018-10-04 14:23:35,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 1927. [2018-10-04 14:23:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1927 states. [2018-10-04 14:23:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 6663 transitions. [2018-10-04 14:23:35,459 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 6663 transitions. Word has length 9 [2018-10-04 14:23:35,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:35,459 INFO L480 AbstractCegarLoop]: Abstraction has 1927 states and 6663 transitions. [2018-10-04 14:23:35,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:23:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 6663 transitions. [2018-10-04 14:23:35,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:23:35,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:35,461 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:23:35,461 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:35,461 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:35,461 INFO L82 PathProgramCache]: Analyzing trace with hash 832700792, now seen corresponding path program 1 times [2018-10-04 14:23:35,461 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:35,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:35,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:35,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:35,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:35,534 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 14:23:35,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:23:35,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-04 14:23:35,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:23:35,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:23:35,536 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:35,536 INFO L87 Difference]: Start difference. First operand 1927 states and 6663 transitions. Second operand 8 states. [2018-10-04 14:23:42,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:42,050 INFO L93 Difference]: Finished difference Result 2832 states and 8631 transitions. [2018-10-04 14:23:42,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:23:42,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-04 14:23:42,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:42,056 INFO L225 Difference]: With dead ends: 2832 [2018-10-04 14:23:42,056 INFO L226 Difference]: Without dead ends: 2824 [2018-10-04 14:23:42,057 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 14:23:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2018-10-04 14:23:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 1904. [2018-10-04 14:23:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-10-04 14:23:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 6553 transitions. [2018-10-04 14:23:44,391 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 6553 transitions. Word has length 9 [2018-10-04 14:23:44,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:44,391 INFO L480 AbstractCegarLoop]: Abstraction has 1904 states and 6553 transitions. [2018-10-04 14:23:44,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:23:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 6553 transitions. [2018-10-04 14:23:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:23:44,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:44,393 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:23:44,393 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:44,393 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:44,393 INFO L82 PathProgramCache]: Analyzing trace with hash -595843680, now seen corresponding path program 1 times [2018-10-04 14:23:44,393 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:44,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:44,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:44,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:44,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:44,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:23:44,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:23:44,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:23:44,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:23:44,477 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:44,477 INFO L87 Difference]: Start difference. First operand 1904 states and 6553 transitions. Second operand 9 states. [2018-10-04 14:23:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:51,569 INFO L93 Difference]: Finished difference Result 3157 states and 9716 transitions. [2018-10-04 14:23:51,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:23:51,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 14:23:51,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:51,575 INFO L225 Difference]: With dead ends: 3157 [2018-10-04 14:23:51,575 INFO L226 Difference]: Without dead ends: 3151 [2018-10-04 14:23:51,576 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 14:23:51,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2018-10-04 14:23:53,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 1949. [2018-10-04 14:23:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2018-10-04 14:23:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 6722 transitions. [2018-10-04 14:23:53,897 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 6722 transitions. Word has length 9 [2018-10-04 14:23:53,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:53,897 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 6722 transitions. [2018-10-04 14:23:53,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:23:53,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 6722 transitions. [2018-10-04 14:23:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:23:53,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:53,899 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:23:53,899 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:53,899 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:53,900 INFO L82 PathProgramCache]: Analyzing trace with hash -595843677, now seen corresponding path program 1 times [2018-10-04 14:23:53,900 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:53,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:53,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:53,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:53,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:54,010 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 14:23:54,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:23:54,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:23:54,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:23:54,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:23:54,011 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:54,011 INFO L87 Difference]: Start difference. First operand 1949 states and 6722 transitions. Second operand 9 states. [2018-10-04 14:24:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:03,686 INFO L93 Difference]: Finished difference Result 3822 states and 11523 transitions. [2018-10-04 14:24:03,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:24:03,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 14:24:03,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:03,696 INFO L225 Difference]: With dead ends: 3822 [2018-10-04 14:24:03,696 INFO L226 Difference]: Without dead ends: 3816 [2018-10-04 14:24:03,697 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 27 [2018-10-04 14:24:03,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2018-10-04 14:24:06,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 2098. [2018-10-04 14:24:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-10-04 14:24:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 7405 transitions. [2018-10-04 14:24:06,366 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 7405 transitions. Word has length 9 [2018-10-04 14:24:06,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:06,367 INFO L480 AbstractCegarLoop]: Abstraction has 2098 states and 7405 transitions. [2018-10-04 14:24:06,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:24:06,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 7405 transitions. [2018-10-04 14:24:06,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:24:06,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:06,369 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:24:06,369 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr4ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:06,369 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:06,369 INFO L82 PathProgramCache]: Analyzing trace with hash -204435682, now seen corresponding path program 1 times [2018-10-04 14:24:06,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:06,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:06,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:06,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:06,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:06,547 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 14:24:06,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:24:06,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:24:06,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:24:06,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:24:06,548 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:06,548 INFO L87 Difference]: Start difference. First operand 2098 states and 7405 transitions. Second operand 9 states. [2018-10-04 14:24:17,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:17,480 INFO L93 Difference]: Finished difference Result 4144 states and 12499 transitions. [2018-10-04 14:24:17,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:24:17,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 14:24:17,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:17,487 INFO L225 Difference]: With dead ends: 4144 [2018-10-04 14:24:17,488 INFO L226 Difference]: Without dead ends: 4138 [2018-10-04 14:24:17,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 21 [2018-10-04 14:24:17,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. Received shutdown request... [2018-10-04 14:24:20,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 2260. [2018-10-04 14:24:20,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2018-10-04 14:24:20,535 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 14:24:20,541 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 14:24:20,541 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:24:20 BoogieIcfgContainer [2018-10-04 14:24:20,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:24:20,542 INFO L168 Benchmark]: Toolchain (without parser) took 268622.47 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -25.7 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-04 14:24:20,547 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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 14:24:20,548 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.65 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 14:24:20,548 INFO L168 Benchmark]: Boogie Preprocessor took 50.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:24:20,549 INFO L168 Benchmark]: RCFGBuilder took 1273.90 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 14:24:20,552 INFO L168 Benchmark]: TraceAbstraction took 267234.64 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -68.0 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-04 14:24:20,559 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.25 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 59.65 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 50.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1273.90 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 267234.64 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -68.0 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: 223]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 223). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 574). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 624]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 624). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 832). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 640). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 594). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 446]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 446). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 847]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 847). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 316]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 316). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 584]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 584). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 589). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 95). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 263]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 263). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 71). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 569). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 199). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 675). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 337). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 604]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 604). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 599]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 599). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 660). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 816]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 816). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 645). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 470]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 470). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 194]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 194). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 800]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 800). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 579). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 27 error locations. TIMEOUT Result, 267.1s OverallTime, 50 OverallIterations, 2 TraceHistogramMax, 214.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13957 SDtfs, 25016 SDslu, 26630 SDs, 0 SdLazy, 96106 SolverSat, 9058 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 103.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 765 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 761 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.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: 45.3s AutomataMinimizationTime, 50 MinimizatonAttempts, 38917 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.2s 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_14-24-20-579.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_14-24-20-579.csv Completed graceful shutdown