java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:35:03,066 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:35:03,068 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:35:03,080 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:35:03,080 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:35:03,081 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:35:03,083 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:35:03,084 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:35:03,086 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:35:03,087 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:35:03,088 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:35:03,088 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:35:03,089 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:35:03,090 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:35:03,091 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:35:03,093 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:35:03,093 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:35:03,095 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:35:03,097 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:35:03,099 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:35:03,100 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:35:03,101 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:35:03,104 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:35:03,104 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:35:03,105 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:35:03,105 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:35:03,106 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:35:03,107 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:35:03,108 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:35:03,109 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:35:03,109 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:35:03,110 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:35:03,110 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:35:03,111 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:35:03,112 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:35:03,112 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:35:03,113 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-02 11:35:03,129 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:35:03,129 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:35:03,130 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:35:03,130 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:35:03,131 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:35:03,131 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:35:03,131 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:35:03,132 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:35:03,132 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:35:03,132 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:35:03,132 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:35:03,132 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:35:03,132 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:35:03,133 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:35:03,133 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:35:03,133 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:35:03,133 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:35:03,133 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:35:03,134 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:35:03,134 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:35:03,134 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:35:03,134 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:35:03,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:35:03,135 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:35:03,135 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:35:03,136 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:35:03,137 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:35:03,137 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:35:03,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:35:03,137 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:35:03,200 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:35:03,216 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:35:03,222 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:35:03,224 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:35:03,225 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:35:03,225 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-02 11:35:03,226 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-10-02 11:35:03,329 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:35:03,333 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:35:03,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:35:03,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:35:03,334 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:35:03,355 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 02.10 11:35:03" (1/1) ... [2018-10-02 11:35:03,369 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 02.10 11:35:03" (1/1) ... [2018-10-02 11:35:03,374 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-02 11:35:03,374 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-02 11:35:03,374 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-02 11:35:03,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:35:03,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:35:03,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:35:03,378 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:35:03,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:03" (1/1) ... [2018-10-02 11:35:03,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:03" (1/1) ... [2018-10-02 11:35:03,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:03" (1/1) ... [2018-10-02 11:35:03,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:03" (1/1) ... [2018-10-02 11:35:03,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:03" (1/1) ... [2018-10-02 11:35:03,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:03" (1/1) ... [2018-10-02 11:35:03,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:03" (1/1) ... [2018-10-02 11:35:03,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:35:03,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:35:03,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:35:03,419 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:35:03,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:03" (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-02 11:35:03,486 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-02 11:35:03,486 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-02 11:35:03,487 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-02 11:35:04,817 INFO L337 CfgBuilder]: Using library mode [2018-10-02 11:35:04,817 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:35:04 BoogieIcfgContainer [2018-10-02 11:35:04,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:35:04,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:35:04,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:35:04,823 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:35:04,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:03" (1/2) ... [2018-10-02 11:35:04,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747d25e9 and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:35:04, skipping insertion in model container [2018-10-02 11:35:04,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:35:04" (2/2) ... [2018-10-02 11:35:04,826 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-10-02 11:35:04,836 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:35:04,845 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-10-02 11:35:04,900 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:35:04,901 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:35:04,901 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:35:04,902 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:35:04,902 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:35:04,902 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:35:04,902 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:35:04,902 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:35:04,903 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:35:04,934 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-10-02 11:35:04,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 11:35:04,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:04,946 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-02 11:35:04,955 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:04,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:04,963 INFO L82 PathProgramCache]: Analyzing trace with hash 45506320, now seen corresponding path program 1 times [2018-10-02 11:35:04,965 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:04,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:05,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:05,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:05,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:05,269 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-02 11:35:05,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:05,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:35:05,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:35:05,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:35:05,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:35:05,293 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 5 states. [2018-10-02 11:35:06,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:06,964 INFO L93 Difference]: Finished difference Result 142 states and 303 transitions. [2018-10-02 11:35:06,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:35:06,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-02 11:35:06,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:06,984 INFO L225 Difference]: With dead ends: 142 [2018-10-02 11:35:06,985 INFO L226 Difference]: Without dead ends: 138 [2018-10-02 11:35:06,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:07,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-02 11:35:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2018-10-02 11:35:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-02 11:35:07,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 219 transitions. [2018-10-02 11:35:07,053 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 219 transitions. Word has length 5 [2018-10-02 11:35:07,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:07,057 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 219 transitions. [2018-10-02 11:35:07,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:35:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 219 transitions. [2018-10-02 11:35:07,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 11:35:07,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:07,059 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-02 11:35:07,060 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:07,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:07,061 INFO L82 PathProgramCache]: Analyzing trace with hash 45756290, now seen corresponding path program 1 times [2018-10-02 11:35:07,061 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:07,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:07,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:07,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:07,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:07,379 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 8 [2018-10-02 11:35:07,391 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-02 11:35:07,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:07,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:35:07,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:35:07,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:35:07,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:35:07,396 INFO L87 Difference]: Start difference. First operand 98 states and 219 transitions. Second operand 5 states. [2018-10-02 11:35:08,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:08,934 INFO L93 Difference]: Finished difference Result 241 states and 539 transitions. [2018-10-02 11:35:08,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 11:35:08,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-02 11:35:08,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:08,942 INFO L225 Difference]: With dead ends: 241 [2018-10-02 11:35:08,942 INFO L226 Difference]: Without dead ends: 237 [2018-10-02 11:35:08,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:08,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-02 11:35:08,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 134. [2018-10-02 11:35:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-02 11:35:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2018-10-02 11:35:08,977 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 5 [2018-10-02 11:35:08,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:08,977 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2018-10-02 11:35:08,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:35:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2018-10-02 11:35:08,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 11:35:08,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:08,979 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-02 11:35:08,980 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:08,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:08,981 INFO L82 PathProgramCache]: Analyzing trace with hash 28948051, now seen corresponding path program 1 times [2018-10-02 11:35:08,981 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:08,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:08,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:08,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:08,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:09,119 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-02 11:35:09,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:09,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:35:09,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:35:09,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:35:09,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:35:09,121 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 5 states. [2018-10-02 11:35:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:10,290 INFO L93 Difference]: Finished difference Result 269 states and 639 transitions. [2018-10-02 11:35:10,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 11:35:10,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-02 11:35:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:10,295 INFO L225 Difference]: With dead ends: 269 [2018-10-02 11:35:10,295 INFO L226 Difference]: Without dead ends: 265 [2018-10-02 11:35:10,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:10,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-02 11:35:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 162. [2018-10-02 11:35:10,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-02 11:35:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 455 transitions. [2018-10-02 11:35:10,332 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 455 transitions. Word has length 5 [2018-10-02 11:35:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:10,333 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 455 transitions. [2018-10-02 11:35:10,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:35:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 455 transitions. [2018-10-02 11:35:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:10,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:10,335 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:10,336 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:10,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:10,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558066, now seen corresponding path program 1 times [2018-10-02 11:35:10,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:10,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:10,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:10,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:10,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:10,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:10,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:10,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:35:10,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:10,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:10,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:10,461 INFO L87 Difference]: Start difference. First operand 162 states and 455 transitions. Second operand 8 states. [2018-10-02 11:35:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:15,254 INFO L93 Difference]: Finished difference Result 790 states and 2085 transitions. [2018-10-02 11:35:15,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 11:35:15,256 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:35:15,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:15,261 INFO L225 Difference]: With dead ends: 790 [2018-10-02 11:35:15,261 INFO L226 Difference]: Without dead ends: 629 [2018-10-02 11:35:15,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:35:15,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-02 11:35:15,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 278. [2018-10-02 11:35:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-02 11:35:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 854 transitions. [2018-10-02 11:35:15,317 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 854 transitions. Word has length 8 [2018-10-02 11:35:15,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:15,317 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 854 transitions. [2018-10-02 11:35:15,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:15,318 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 854 transitions. [2018-10-02 11:35:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:15,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:15,320 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:15,321 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:15,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:15,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558063, now seen corresponding path program 1 times [2018-10-02 11:35:15,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:15,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:15,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:15,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:15,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:15,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:15,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:35:15,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:15,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:15,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:15,550 INFO L87 Difference]: Start difference. First operand 278 states and 854 transitions. Second operand 8 states. [2018-10-02 11:35:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:18,528 INFO L93 Difference]: Finished difference Result 634 states and 1540 transitions. [2018-10-02 11:35:18,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:35:18,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:35:18,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:18,534 INFO L225 Difference]: With dead ends: 634 [2018-10-02 11:35:18,535 INFO L226 Difference]: Without dead ends: 628 [2018-10-02 11:35:18,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:35:18,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-10-02 11:35:18,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 310. [2018-10-02 11:35:18,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-02 11:35:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 963 transitions. [2018-10-02 11:35:18,591 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 963 transitions. Word has length 8 [2018-10-02 11:35:18,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:18,591 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 963 transitions. [2018-10-02 11:35:18,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:18,592 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 963 transitions. [2018-10-02 11:35:18,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:18,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:18,594 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:18,595 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:18,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:18,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1080099218, now seen corresponding path program 1 times [2018-10-02 11:35:18,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:18,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:18,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:18,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:18,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:18,747 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-02 11:35:18,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:18,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:35:18,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:18,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:18,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:18,749 INFO L87 Difference]: Start difference. First operand 310 states and 963 transitions. Second operand 8 states. [2018-10-02 11:35:20,261 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-02 11:35:22,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:22,393 INFO L93 Difference]: Finished difference Result 768 states and 2087 transitions. [2018-10-02 11:35:22,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 11:35:22,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:35:22,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:22,397 INFO L225 Difference]: With dead ends: 768 [2018-10-02 11:35:22,398 INFO L226 Difference]: Without dead ends: 537 [2018-10-02 11:35:22,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:35:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-10-02 11:35:22,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 334. [2018-10-02 11:35:22,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-02 11:35:22,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1037 transitions. [2018-10-02 11:35:22,459 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1037 transitions. Word has length 8 [2018-10-02 11:35:22,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:22,460 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1037 transitions. [2018-10-02 11:35:22,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:22,460 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1037 transitions. [2018-10-02 11:35:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:22,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:22,462 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:22,462 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:22,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:22,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595081, now seen corresponding path program 1 times [2018-10-02 11:35:22,463 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:22,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:22,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:22,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:22,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:22,979 WARN L178 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-10-02 11:35:23,431 WARN L178 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-10-02 11:35:23,847 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-02 11:35:23,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:23,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:35:23,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:23,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:23,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:23,849 INFO L87 Difference]: Start difference. First operand 334 states and 1037 transitions. Second operand 8 states. [2018-10-02 11:35:26,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:26,419 INFO L93 Difference]: Finished difference Result 1145 states and 3146 transitions. [2018-10-02 11:35:26,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:35:26,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:35:26,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:26,427 INFO L225 Difference]: With dead ends: 1145 [2018-10-02 11:35:26,427 INFO L226 Difference]: Without dead ends: 812 [2018-10-02 11:35:26,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:35:26,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-10-02 11:35:26,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 450. [2018-10-02 11:35:26,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-10-02 11:35:26,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1432 transitions. [2018-10-02 11:35:26,498 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1432 transitions. Word has length 8 [2018-10-02 11:35:26,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:26,498 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1432 transitions. [2018-10-02 11:35:26,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:26,498 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1432 transitions. [2018-10-02 11:35:26,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:26,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:26,500 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:26,501 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:26,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:26,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595078, now seen corresponding path program 1 times [2018-10-02 11:35:26,501 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:26,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:26,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:26,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:26,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:26,719 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-02 11:35:26,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:26,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:35:26,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:26,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:26,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:26,721 INFO L87 Difference]: Start difference. First operand 450 states and 1432 transitions. Second operand 8 states. [2018-10-02 11:35:28,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:28,999 INFO L93 Difference]: Finished difference Result 877 states and 2260 transitions. [2018-10-02 11:35:28,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 11:35:28,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:35:29,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:29,006 INFO L225 Difference]: With dead ends: 877 [2018-10-02 11:35:29,006 INFO L226 Difference]: Without dead ends: 871 [2018-10-02 11:35:29,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:35:29,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-10-02 11:35:29,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 478. [2018-10-02 11:35:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-10-02 11:35:29,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1531 transitions. [2018-10-02 11:35:29,094 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1531 transitions. Word has length 8 [2018-10-02 11:35:29,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:29,094 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 1531 transitions. [2018-10-02 11:35:29,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1531 transitions. [2018-10-02 11:35:29,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:29,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:29,096 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:29,097 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:29,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:29,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064444, now seen corresponding path program 1 times [2018-10-02 11:35:29,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:29,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:29,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:29,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:29,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:29,268 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-02 11:35:29,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:29,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:35:29,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:29,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:29,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:29,270 INFO L87 Difference]: Start difference. First operand 478 states and 1531 transitions. Second operand 8 states. [2018-10-02 11:35:31,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:31,322 INFO L93 Difference]: Finished difference Result 1049 states and 2854 transitions. [2018-10-02 11:35:31,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 11:35:31,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:35:31,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:31,328 INFO L225 Difference]: With dead ends: 1049 [2018-10-02 11:35:31,328 INFO L226 Difference]: Without dead ends: 818 [2018-10-02 11:35:31,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:35:31,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-10-02 11:35:31,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 524. [2018-10-02 11:35:31,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-02 11:35:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1684 transitions. [2018-10-02 11:35:31,429 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1684 transitions. Word has length 8 [2018-10-02 11:35:31,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:31,429 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 1684 transitions. [2018-10-02 11:35:31,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:31,429 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1684 transitions. [2018-10-02 11:35:31,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:31,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:31,431 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:31,431 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:31,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:31,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064441, now seen corresponding path program 1 times [2018-10-02 11:35:31,432 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:31,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:31,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:31,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:31,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:31,541 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-02 11:35:31,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:31,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:35:31,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:31,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:31,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:31,542 INFO L87 Difference]: Start difference. First operand 524 states and 1684 transitions. Second operand 8 states. [2018-10-02 11:35:33,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:33,336 INFO L93 Difference]: Finished difference Result 733 states and 1997 transitions. [2018-10-02 11:35:33,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 11:35:33,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:35:33,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:33,343 INFO L225 Difference]: With dead ends: 733 [2018-10-02 11:35:33,343 INFO L226 Difference]: Without dead ends: 727 [2018-10-02 11:35:33,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:35:33,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-10-02 11:35:33,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 530. [2018-10-02 11:35:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-10-02 11:35:33,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1690 transitions. [2018-10-02 11:35:33,461 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1690 transitions. Word has length 8 [2018-10-02 11:35:33,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:33,461 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1690 transitions. [2018-10-02 11:35:33,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:33,462 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1690 transitions. [2018-10-02 11:35:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:33,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:33,463 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:33,464 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:33,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:33,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656691, now seen corresponding path program 1 times [2018-10-02 11:35:33,464 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:33,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:33,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:33,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:33,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:33,872 WARN L178 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-10-02 11:35:33,901 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-02 11:35:33,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:33,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:35:33,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:33,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:33,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:33,903 INFO L87 Difference]: Start difference. First operand 530 states and 1690 transitions. Second operand 8 states. [2018-10-02 11:35:36,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:36,992 INFO L93 Difference]: Finished difference Result 1329 states and 3609 transitions. [2018-10-02 11:35:36,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-02 11:35:36,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:35:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:37,001 INFO L225 Difference]: With dead ends: 1329 [2018-10-02 11:35:37,002 INFO L226 Difference]: Without dead ends: 1323 [2018-10-02 11:35:37,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-10-02 11:35:37,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-10-02 11:35:37,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 626. [2018-10-02 11:35:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-10-02 11:35:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 2087 transitions. [2018-10-02 11:35:37,155 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 2087 transitions. Word has length 8 [2018-10-02 11:35:37,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:37,156 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 2087 transitions. [2018-10-02 11:35:37,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:37,156 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 2087 transitions. [2018-10-02 11:35:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:37,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:37,157 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:37,158 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:37,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:37,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656688, now seen corresponding path program 1 times [2018-10-02 11:35:37,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:37,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:37,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:37,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:37,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:37,431 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-02 11:35:37,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:37,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:35:37,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:37,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:37,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:37,433 INFO L87 Difference]: Start difference. First operand 626 states and 2087 transitions. Second operand 8 states. [2018-10-02 11:35:39,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:39,923 INFO L93 Difference]: Finished difference Result 1268 states and 3539 transitions. [2018-10-02 11:35:39,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 11:35:39,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:35:39,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:39,931 INFO L225 Difference]: With dead ends: 1268 [2018-10-02 11:35:39,931 INFO L226 Difference]: Without dead ends: 1262 [2018-10-02 11:35:39,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:35:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-10-02 11:35:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 618. [2018-10-02 11:35:40,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-02 11:35:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2056 transitions. [2018-10-02 11:35:40,075 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2056 transitions. Word has length 8 [2018-10-02 11:35:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:40,075 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 2056 transitions. [2018-10-02 11:35:40,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2056 transitions. [2018-10-02 11:35:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:40,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:40,076 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:40,077 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:40,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:40,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285639, now seen corresponding path program 1 times [2018-10-02 11:35:40,077 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:40,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:40,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:40,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:40,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:40,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:40,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:40,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:35:40,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:40,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:40,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:40,191 INFO L87 Difference]: Start difference. First operand 618 states and 2056 transitions. Second operand 8 states. [2018-10-02 11:35:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:42,667 INFO L93 Difference]: Finished difference Result 1367 states and 3876 transitions. [2018-10-02 11:35:42,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 11:35:42,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:35:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:42,675 INFO L225 Difference]: With dead ends: 1367 [2018-10-02 11:35:42,675 INFO L226 Difference]: Without dead ends: 1361 [2018-10-02 11:35:42,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:35:42,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-10-02 11:35:42,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 671. [2018-10-02 11:35:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-10-02 11:35:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2249 transitions. [2018-10-02 11:35:42,842 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2249 transitions. Word has length 8 [2018-10-02 11:35:42,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:42,842 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 2249 transitions. [2018-10-02 11:35:42,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:42,842 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2249 transitions. [2018-10-02 11:35:42,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:42,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:42,843 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:42,844 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:42,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:42,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285636, now seen corresponding path program 1 times [2018-10-02 11:35:42,844 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:42,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:42,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:42,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:42,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:43,031 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-02 11:35:43,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:43,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:35:43,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:43,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:43,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:43,032 INFO L87 Difference]: Start difference. First operand 671 states and 2249 transitions. Second operand 8 states. [2018-10-02 11:35:46,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:46,325 INFO L93 Difference]: Finished difference Result 1373 states and 3787 transitions. [2018-10-02 11:35:46,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 11:35:46,325 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:35:46,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:46,336 INFO L225 Difference]: With dead ends: 1373 [2018-10-02 11:35:46,336 INFO L226 Difference]: Without dead ends: 1367 [2018-10-02 11:35:46,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:35:46,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-10-02 11:35:46,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 698. [2018-10-02 11:35:46,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-10-02 11:35:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2344 transitions. [2018-10-02 11:35:46,528 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2344 transitions. Word has length 8 [2018-10-02 11:35:46,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:46,529 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 2344 transitions. [2018-10-02 11:35:46,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2344 transitions. [2018-10-02 11:35:46,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:46,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:46,530 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:46,531 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:46,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:46,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280348, now seen corresponding path program 1 times [2018-10-02 11:35:46,531 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:46,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:46,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:46,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:46,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:46,659 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-02 11:35:46,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:46,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:35:46,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:46,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:46,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:46,661 INFO L87 Difference]: Start difference. First operand 698 states and 2344 transitions. Second operand 7 states. [2018-10-02 11:35:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:48,886 INFO L93 Difference]: Finished difference Result 1526 states and 4298 transitions. [2018-10-02 11:35:48,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:35:48,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 11:35:48,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:48,895 INFO L225 Difference]: With dead ends: 1526 [2018-10-02 11:35:48,895 INFO L226 Difference]: Without dead ends: 1520 [2018-10-02 11:35:48,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:35:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-10-02 11:35:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 789. [2018-10-02 11:35:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-10-02 11:35:49,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2673 transitions. [2018-10-02 11:35:49,141 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2673 transitions. Word has length 8 [2018-10-02 11:35:49,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:49,141 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 2673 transitions. [2018-10-02 11:35:49,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:49,141 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2673 transitions. [2018-10-02 11:35:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:49,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:49,143 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:49,144 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:49,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:49,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280221, now seen corresponding path program 1 times [2018-10-02 11:35:49,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:49,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:49,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:49,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:49,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:49,266 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-02 11:35:49,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:49,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:35:49,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:49,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:49,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:49,268 INFO L87 Difference]: Start difference. First operand 789 states and 2673 transitions. Second operand 7 states. [2018-10-02 11:35:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:51,463 INFO L93 Difference]: Finished difference Result 1548 states and 4356 transitions. [2018-10-02 11:35:51,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:35:51,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 11:35:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:51,470 INFO L225 Difference]: With dead ends: 1548 [2018-10-02 11:35:51,471 INFO L226 Difference]: Without dead ends: 1542 [2018-10-02 11:35:51,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:35:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-10-02 11:35:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 821. [2018-10-02 11:35:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-02 11:35:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2801 transitions. [2018-10-02 11:35:51,686 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2801 transitions. Word has length 8 [2018-10-02 11:35:51,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:51,687 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 2801 transitions. [2018-10-02 11:35:51,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:51,687 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2801 transitions. [2018-10-02 11:35:51,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:51,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:51,689 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:51,689 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:51,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:51,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878937, now seen corresponding path program 1 times [2018-10-02 11:35:51,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:51,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:51,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:51,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:51,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:51,802 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-02 11:35:51,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:51,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:35:51,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:51,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:51,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:51,803 INFO L87 Difference]: Start difference. First operand 821 states and 2801 transitions. Second operand 7 states. [2018-10-02 11:35:54,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:54,237 INFO L93 Difference]: Finished difference Result 1575 states and 4539 transitions. [2018-10-02 11:35:54,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:35:54,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 11:35:54,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:54,245 INFO L225 Difference]: With dead ends: 1575 [2018-10-02 11:35:54,245 INFO L226 Difference]: Without dead ends: 1569 [2018-10-02 11:35:54,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:35:54,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-10-02 11:35:54,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 849. [2018-10-02 11:35:54,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-10-02 11:35:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2913 transitions. [2018-10-02 11:35:54,481 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2913 transitions. Word has length 8 [2018-10-02 11:35:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:54,481 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 2913 transitions. [2018-10-02 11:35:54,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2913 transitions. [2018-10-02 11:35:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:54,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:54,482 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:54,482 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:54,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:54,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878810, now seen corresponding path program 1 times [2018-10-02 11:35:54,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:54,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:54,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:54,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:54,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:54,586 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-02 11:35:54,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:54,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:35:54,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:54,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:54,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:54,588 INFO L87 Difference]: Start difference. First operand 849 states and 2913 transitions. Second operand 7 states. [2018-10-02 11:35:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:56,835 INFO L93 Difference]: Finished difference Result 1597 states and 4579 transitions. [2018-10-02 11:35:56,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 11:35:56,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 11:35:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:56,846 INFO L225 Difference]: With dead ends: 1597 [2018-10-02 11:35:56,846 INFO L226 Difference]: Without dead ends: 1591 [2018-10-02 11:35:56,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:56,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-10-02 11:35:57,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 873. [2018-10-02 11:35:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-10-02 11:35:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2993 transitions. [2018-10-02 11:35:57,106 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2993 transitions. Word has length 8 [2018-10-02 11:35:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:57,106 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 2993 transitions. [2018-10-02 11:35:57,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2993 transitions. [2018-10-02 11:35:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:57,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:57,108 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:57,108 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:57,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:57,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288024, now seen corresponding path program 1 times [2018-10-02 11:35:57,109 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:57,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:57,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:57,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:57,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:57,243 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-02 11:35:57,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:57,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:35:57,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:57,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:57,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:57,245 INFO L87 Difference]: Start difference. First operand 873 states and 2993 transitions. Second operand 7 states. [2018-10-02 11:35:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:59,463 INFO L93 Difference]: Finished difference Result 1726 states and 5211 transitions. [2018-10-02 11:35:59,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 11:35:59,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 11:35:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:59,474 INFO L225 Difference]: With dead ends: 1726 [2018-10-02 11:35:59,474 INFO L226 Difference]: Without dead ends: 1720 [2018-10-02 11:35:59,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:35:59,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2018-10-02 11:35:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1006. [2018-10-02 11:35:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-10-02 11:35:59,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3474 transitions. [2018-10-02 11:35:59,800 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3474 transitions. Word has length 8 [2018-10-02 11:35:59,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:59,800 INFO L480 AbstractCegarLoop]: Abstraction has 1006 states and 3474 transitions. [2018-10-02 11:35:59,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:59,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3474 transitions. [2018-10-02 11:35:59,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:35:59,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:59,801 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:59,802 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:59,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:59,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288027, now seen corresponding path program 1 times [2018-10-02 11:35:59,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:59,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:59,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:59,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:59,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:59,946 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-02 11:35:59,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:59,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:35:59,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:59,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:59,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:59,948 INFO L87 Difference]: Start difference. First operand 1006 states and 3474 transitions. Second operand 7 states. [2018-10-02 11:36:02,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:02,388 INFO L93 Difference]: Finished difference Result 1758 states and 5203 transitions. [2018-10-02 11:36:02,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 11:36:02,389 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 11:36:02,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:02,395 INFO L225 Difference]: With dead ends: 1758 [2018-10-02 11:36:02,395 INFO L226 Difference]: Without dead ends: 1752 [2018-10-02 11:36:02,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:36:02,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-10-02 11:36:02,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1011. [2018-10-02 11:36:02,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-10-02 11:36:02,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3493 transitions. [2018-10-02 11:36:02,746 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3493 transitions. Word has length 8 [2018-10-02 11:36:02,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:02,746 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 3493 transitions. [2018-10-02 11:36:02,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:36:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3493 transitions. [2018-10-02 11:36:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:36:02,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:02,748 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:02,748 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:02,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:02,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746872, now seen corresponding path program 1 times [2018-10-02 11:36:02,749 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:02,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:02,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:02,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:02,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:02,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:02,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:02,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:36:02,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:36:02,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:36:02,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:36:02,848 INFO L87 Difference]: Start difference. First operand 1011 states and 3493 transitions. Second operand 7 states. [2018-10-02 11:36:05,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:05,873 INFO L93 Difference]: Finished difference Result 1867 states and 5608 transitions. [2018-10-02 11:36:05,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 11:36:05,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 11:36:05,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:05,879 INFO L225 Difference]: With dead ends: 1867 [2018-10-02 11:36:05,879 INFO L226 Difference]: Without dead ends: 1861 [2018-10-02 11:36:05,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:36:05,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2018-10-02 11:36:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1119. [2018-10-02 11:36:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-10-02 11:36:06,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3931 transitions. [2018-10-02 11:36:06,243 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3931 transitions. Word has length 8 [2018-10-02 11:36:06,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:06,244 INFO L480 AbstractCegarLoop]: Abstraction has 1119 states and 3931 transitions. [2018-10-02 11:36:06,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:36:06,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3931 transitions. [2018-10-02 11:36:06,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:36:06,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:06,245 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:06,246 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:06,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:06,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746875, now seen corresponding path program 1 times [2018-10-02 11:36:06,246 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:06,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:06,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:06,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:06,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:06,346 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-02 11:36:06,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:06,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:36:06,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:36:06,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:36:06,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:36:06,348 INFO L87 Difference]: Start difference. First operand 1119 states and 3931 transitions. Second operand 7 states. [2018-10-02 11:36:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:09,438 INFO L93 Difference]: Finished difference Result 1968 states and 5829 transitions. [2018-10-02 11:36:09,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:36:09,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 11:36:09,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:09,448 INFO L225 Difference]: With dead ends: 1968 [2018-10-02 11:36:09,448 INFO L226 Difference]: Without dead ends: 1962 [2018-10-02 11:36:09,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:36:09,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-10-02 11:36:09,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1111. [2018-10-02 11:36:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-10-02 11:36:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3891 transitions. [2018-10-02 11:36:09,945 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3891 transitions. Word has length 8 [2018-10-02 11:36:09,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:09,945 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 3891 transitions. [2018-10-02 11:36:09,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:36:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3891 transitions. [2018-10-02 11:36:09,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:36:09,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:09,946 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:09,947 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:09,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:09,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1616407055, now seen corresponding path program 1 times [2018-10-02 11:36:09,947 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:09,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:09,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:09,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:09,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:10,049 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-02 11:36:10,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:10,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:36:10,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:36:10,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:36:10,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:36:10,051 INFO L87 Difference]: Start difference. First operand 1111 states and 3891 transitions. Second operand 7 states. [2018-10-02 11:36:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:12,750 INFO L93 Difference]: Finished difference Result 2001 states and 6001 transitions. [2018-10-02 11:36:12,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 11:36:12,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 11:36:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:12,758 INFO L225 Difference]: With dead ends: 2001 [2018-10-02 11:36:12,759 INFO L226 Difference]: Without dead ends: 1995 [2018-10-02 11:36:12,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:36:12,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-10-02 11:36:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1117. [2018-10-02 11:36:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-10-02 11:36:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 3909 transitions. [2018-10-02 11:36:13,290 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 3909 transitions. Word has length 8 [2018-10-02 11:36:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:13,290 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 3909 transitions. [2018-10-02 11:36:13,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:36:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 3909 transitions. [2018-10-02 11:36:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:36:13,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:13,292 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:13,292 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:13,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:13,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1616406928, now seen corresponding path program 1 times [2018-10-02 11:36:13,293 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:13,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:13,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:13,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:13,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:13,408 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-02 11:36:13,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:13,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:36:13,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:36:13,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:36:13,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:36:13,409 INFO L87 Difference]: Start difference. First operand 1117 states and 3909 transitions. Second operand 7 states. [2018-10-02 11:36:15,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:15,962 INFO L93 Difference]: Finished difference Result 1708 states and 5233 transitions. [2018-10-02 11:36:15,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 11:36:15,964 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 11:36:15,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:15,969 INFO L225 Difference]: With dead ends: 1708 [2018-10-02 11:36:15,969 INFO L226 Difference]: Without dead ends: 1702 [2018-10-02 11:36:15,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:36:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-10-02 11:36:16,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1210. [2018-10-02 11:36:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2018-10-02 11:36:16,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4307 transitions. [2018-10-02 11:36:16,506 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 4307 transitions. Word has length 8 [2018-10-02 11:36:16,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:16,506 INFO L480 AbstractCegarLoop]: Abstraction has 1210 states and 4307 transitions. [2018-10-02 11:36:16,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:36:16,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 4307 transitions. [2018-10-02 11:36:16,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:36:16,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:16,508 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:16,508 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:16,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:16,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256941, now seen corresponding path program 1 times [2018-10-02 11:36:16,509 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:16,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:16,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:16,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:16,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:16,636 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-02 11:36:16,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:16,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:36:16,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:36:16,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:36:16,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:36:16,637 INFO L87 Difference]: Start difference. First operand 1210 states and 4307 transitions. Second operand 7 states. [2018-10-02 11:36:20,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:20,107 INFO L93 Difference]: Finished difference Result 2402 states and 7321 transitions. [2018-10-02 11:36:20,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:36:20,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 11:36:20,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:20,113 INFO L225 Difference]: With dead ends: 2402 [2018-10-02 11:36:20,113 INFO L226 Difference]: Without dead ends: 2396 [2018-10-02 11:36:20,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:36:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-10-02 11:36:20,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1341. [2018-10-02 11:36:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-10-02 11:36:20,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4862 transitions. [2018-10-02 11:36:20,706 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4862 transitions. Word has length 8 [2018-10-02 11:36:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:20,706 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4862 transitions. [2018-10-02 11:36:20,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:36:20,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4862 transitions. [2018-10-02 11:36:20,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:36:20,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:20,708 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:20,708 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:20,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:20,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256944, now seen corresponding path program 1 times [2018-10-02 11:36:20,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:20,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:20,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:20,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:20,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:20,812 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-02 11:36:20,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:20,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:36:20,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:36:20,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:36:20,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:36:20,814 INFO L87 Difference]: Start difference. First operand 1341 states and 4862 transitions. Second operand 7 states. [2018-10-02 11:36:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:24,008 INFO L93 Difference]: Finished difference Result 2274 states and 6934 transitions. [2018-10-02 11:36:24,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 11:36:24,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-02 11:36:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:24,012 INFO L225 Difference]: With dead ends: 2274 [2018-10-02 11:36:24,012 INFO L226 Difference]: Without dead ends: 2268 [2018-10-02 11:36:24,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:36:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2018-10-02 11:36:24,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1337. [2018-10-02 11:36:24,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-10-02 11:36:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 4840 transitions. [2018-10-02 11:36:24,604 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 4840 transitions. Word has length 8 [2018-10-02 11:36:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:24,604 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 4840 transitions. [2018-10-02 11:36:24,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:36:24,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 4840 transitions. [2018-10-02 11:36:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:36:24,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:24,605 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-02 11:36:24,605 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:24,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:24,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1621267991, now seen corresponding path program 1 times [2018-10-02 11:36:24,605 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:24,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:24,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:24,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:24,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:24,636 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-02 11:36:24,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:24,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:36:24,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:36:24,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:36:24,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:36:24,637 INFO L87 Difference]: Start difference. First operand 1337 states and 4840 transitions. Second operand 4 states. [2018-10-02 11:36:25,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:25,602 INFO L93 Difference]: Finished difference Result 2170 states and 7637 transitions. [2018-10-02 11:36:25,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:36:25,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-02 11:36:25,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:25,605 INFO L225 Difference]: With dead ends: 2170 [2018-10-02 11:36:25,606 INFO L226 Difference]: Without dead ends: 1253 [2018-10-02 11:36:25,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:36:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-10-02 11:36:26,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1080. [2018-10-02 11:36:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-10-02 11:36:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3769 transitions. [2018-10-02 11:36:26,099 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3769 transitions. Word has length 8 [2018-10-02 11:36:26,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:26,100 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 3769 transitions. [2018-10-02 11:36:26,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:36:26,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3769 transitions. [2018-10-02 11:36:26,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:36:26,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:26,101 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:26,101 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:26,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:26,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283460, now seen corresponding path program 1 times [2018-10-02 11:36:26,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:26,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:26,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:26,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:26,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:26,367 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-02 11:36:26,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:26,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:36:26,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:26,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:26,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:26,369 INFO L87 Difference]: Start difference. First operand 1080 states and 3769 transitions. Second operand 8 states. [2018-10-02 11:36:30,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:30,331 INFO L93 Difference]: Finished difference Result 2095 states and 6316 transitions. [2018-10-02 11:36:30,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 11:36:30,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:36:30,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:30,335 INFO L225 Difference]: With dead ends: 2095 [2018-10-02 11:36:30,336 INFO L226 Difference]: Without dead ends: 2093 [2018-10-02 11:36:30,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:36:30,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-10-02 11:36:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1161. [2018-10-02 11:36:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2018-10-02 11:36:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 4123 transitions. [2018-10-02 11:36:30,884 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 4123 transitions. Word has length 8 [2018-10-02 11:36:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:30,885 INFO L480 AbstractCegarLoop]: Abstraction has 1161 states and 4123 transitions. [2018-10-02 11:36:30,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 4123 transitions. [2018-10-02 11:36:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:36:30,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:30,886 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:30,886 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:30,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:30,886 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283333, now seen corresponding path program 1 times [2018-10-02 11:36:30,886 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:30,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:30,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:30,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:30,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:31,326 WARN L178 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-10-02 11:36:31,529 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-10-02 11:36:31,576 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-02 11:36:31,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:31,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:36:31,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:31,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:31,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:31,578 INFO L87 Difference]: Start difference. First operand 1161 states and 4123 transitions. Second operand 8 states. [2018-10-02 11:36:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:35,342 INFO L93 Difference]: Finished difference Result 1994 states and 5988 transitions. [2018-10-02 11:36:35,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:36:35,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:36:35,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:35,347 INFO L225 Difference]: With dead ends: 1994 [2018-10-02 11:36:35,347 INFO L226 Difference]: Without dead ends: 1988 [2018-10-02 11:36:35,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:36:35,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-10-02 11:36:35,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1152. [2018-10-02 11:36:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-10-02 11:36:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 4099 transitions. [2018-10-02 11:36:35,980 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 4099 transitions. Word has length 8 [2018-10-02 11:36:35,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:35,980 INFO L480 AbstractCegarLoop]: Abstraction has 1152 states and 4099 transitions. [2018-10-02 11:36:35,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:35,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 4099 transitions. [2018-10-02 11:36:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:36:35,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:35,982 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:35,982 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:35,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:35,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1867882049, now seen corresponding path program 1 times [2018-10-02 11:36:35,983 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:35,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:35,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:35,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:35,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:36,090 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-02 11:36:36,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:36,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:36:36,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:36,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:36,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:36,091 INFO L87 Difference]: Start difference. First operand 1152 states and 4099 transitions. Second operand 8 states. [2018-10-02 11:36:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:40,454 INFO L93 Difference]: Finished difference Result 2160 states and 6516 transitions. [2018-10-02 11:36:40,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:36:40,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:36:40,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:40,458 INFO L225 Difference]: With dead ends: 2160 [2018-10-02 11:36:40,459 INFO L226 Difference]: Without dead ends: 2154 [2018-10-02 11:36:40,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:36:40,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2018-10-02 11:36:41,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1174. [2018-10-02 11:36:41,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-10-02 11:36:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4164 transitions. [2018-10-02 11:36:41,124 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 4164 transitions. Word has length 8 [2018-10-02 11:36:41,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:41,124 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 4164 transitions. [2018-10-02 11:36:41,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 4164 transitions. [2018-10-02 11:36:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:36:41,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:41,125 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:41,125 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:41,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:41,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1867881922, now seen corresponding path program 1 times [2018-10-02 11:36:41,126 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:41,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:41,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:41,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:41,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:41,285 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-02 11:36:41,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:41,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:36:41,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:41,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:41,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:41,287 INFO L87 Difference]: Start difference. First operand 1174 states and 4164 transitions. Second operand 8 states. [2018-10-02 11:36:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:45,489 INFO L93 Difference]: Finished difference Result 2094 states and 6271 transitions. [2018-10-02 11:36:45,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:36:45,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:36:45,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:45,493 INFO L225 Difference]: With dead ends: 2094 [2018-10-02 11:36:45,493 INFO L226 Difference]: Without dead ends: 2088 [2018-10-02 11:36:45,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:36:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2018-10-02 11:36:46,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1153. [2018-10-02 11:36:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-10-02 11:36:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 4095 transitions. [2018-10-02 11:36:46,135 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 4095 transitions. Word has length 8 [2018-10-02 11:36:46,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:46,135 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 4095 transitions. [2018-10-02 11:36:46,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:46,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 4095 transitions. [2018-10-02 11:36:46,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:36:46,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:46,137 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-02 11:36:46,137 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:46,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:46,137 INFO L82 PathProgramCache]: Analyzing trace with hash -896988374, now seen corresponding path program 1 times [2018-10-02 11:36:46,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:46,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:46,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:46,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:46,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:46,248 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-02 11:36:46,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:46,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 11:36:46,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:36:46,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:36:46,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:36:46,250 INFO L87 Difference]: Start difference. First operand 1153 states and 4095 transitions. Second operand 4 states. [2018-10-02 11:36:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:47,348 INFO L93 Difference]: Finished difference Result 1929 states and 6604 transitions. [2018-10-02 11:36:47,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:36:47,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-02 11:36:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:47,351 INFO L225 Difference]: With dead ends: 1929 [2018-10-02 11:36:47,352 INFO L226 Difference]: Without dead ends: 1400 [2018-10-02 11:36:47,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:36:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2018-10-02 11:36:48,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1083. [2018-10-02 11:36:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2018-10-02 11:36:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3765 transitions. [2018-10-02 11:36:48,112 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 3765 transitions. Word has length 8 [2018-10-02 11:36:48,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:48,113 INFO L480 AbstractCegarLoop]: Abstraction has 1083 states and 3765 transitions. [2018-10-02 11:36:48,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:36:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 3765 transitions. [2018-10-02 11:36:48,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:36:48,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:48,114 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:48,114 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:48,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:48,114 INFO L82 PathProgramCache]: Analyzing trace with hash -896379114, now seen corresponding path program 1 times [2018-10-02 11:36:48,114 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:48,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:48,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:48,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:48,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:48,217 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-02 11:36:48,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:48,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:36:48,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:48,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:48,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:48,219 INFO L87 Difference]: Start difference. First operand 1083 states and 3765 transitions. Second operand 8 states. [2018-10-02 11:36:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:52,008 INFO L93 Difference]: Finished difference Result 2276 states and 6948 transitions. [2018-10-02 11:36:52,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 11:36:52,009 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:36:52,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:52,013 INFO L225 Difference]: With dead ends: 2276 [2018-10-02 11:36:52,013 INFO L226 Difference]: Without dead ends: 2270 [2018-10-02 11:36:52,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:36:52,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2018-10-02 11:36:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1266. [2018-10-02 11:36:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2018-10-02 11:36:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4418 transitions. [2018-10-02 11:36:52,824 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 4418 transitions. Word has length 8 [2018-10-02 11:36:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:52,824 INFO L480 AbstractCegarLoop]: Abstraction has 1266 states and 4418 transitions. [2018-10-02 11:36:52,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 4418 transitions. [2018-10-02 11:36:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:36:52,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:52,825 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:52,826 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:52,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:52,826 INFO L82 PathProgramCache]: Analyzing trace with hash -896379111, now seen corresponding path program 1 times [2018-10-02 11:36:52,826 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:52,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:52,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:52,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:52,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:52,913 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-02 11:36:52,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:52,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:36:52,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:52,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:52,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:52,915 INFO L87 Difference]: Start difference. First operand 1266 states and 4418 transitions. Second operand 8 states. [2018-10-02 11:36:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:57,214 INFO L93 Difference]: Finished difference Result 2425 states and 7363 transitions. [2018-10-02 11:36:57,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:36:57,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:36:57,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:57,219 INFO L225 Difference]: With dead ends: 2425 [2018-10-02 11:36:57,219 INFO L226 Difference]: Without dead ends: 2419 [2018-10-02 11:36:57,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:36:57,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2018-10-02 11:36:58,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1373. [2018-10-02 11:36:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2018-10-02 11:36:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 4822 transitions. [2018-10-02 11:36:58,223 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 4822 transitions. Word has length 8 [2018-10-02 11:36:58,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:58,223 INFO L480 AbstractCegarLoop]: Abstraction has 1373 states and 4822 transitions. [2018-10-02 11:36:58,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:36:58,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 4822 transitions. [2018-10-02 11:36:58,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:36:58,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:58,225 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:58,225 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:58,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:58,225 INFO L82 PathProgramCache]: Analyzing trace with hash -881085998, now seen corresponding path program 1 times [2018-10-02 11:36:58,225 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:58,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:58,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:58,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:58,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:58,317 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-02 11:36:58,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:36:58,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:36:58,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:36:58,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:36:58,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:36:58,319 INFO L87 Difference]: Start difference. First operand 1373 states and 4822 transitions. Second operand 8 states. [2018-10-02 11:37:02,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:02,937 INFO L93 Difference]: Finished difference Result 2278 states and 6952 transitions. [2018-10-02 11:37:02,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 11:37:02,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:37:02,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:02,943 INFO L225 Difference]: With dead ends: 2278 [2018-10-02 11:37:02,943 INFO L226 Difference]: Without dead ends: 2272 [2018-10-02 11:37:02,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:37:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2018-10-02 11:37:03,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1421. [2018-10-02 11:37:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2018-10-02 11:37:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 4963 transitions. [2018-10-02 11:37:03,899 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 4963 transitions. Word has length 8 [2018-10-02 11:37:03,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:03,899 INFO L480 AbstractCegarLoop]: Abstraction has 1421 states and 4963 transitions. [2018-10-02 11:37:03,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:37:03,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 4963 transitions. [2018-10-02 11:37:03,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:37:03,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:03,900 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:03,900 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:03,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:03,901 INFO L82 PathProgramCache]: Analyzing trace with hash -881086125, now seen corresponding path program 1 times [2018-10-02 11:37:03,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:03,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:03,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:03,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:03,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:03,996 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-02 11:37:03,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:37:03,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:37:03,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:37:03,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:37:03,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:37:03,997 INFO L87 Difference]: Start difference. First operand 1421 states and 4963 transitions. Second operand 8 states. [2018-10-02 11:37:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:08,374 INFO L93 Difference]: Finished difference Result 2233 states and 6848 transitions. [2018-10-02 11:37:08,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 11:37:08,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:37:08,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:08,379 INFO L225 Difference]: With dead ends: 2233 [2018-10-02 11:37:08,380 INFO L226 Difference]: Without dead ends: 2227 [2018-10-02 11:37:08,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:37:08,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2018-10-02 11:37:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1411. [2018-10-02 11:37:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-10-02 11:37:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 4926 transitions. [2018-10-02 11:37:09,377 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 4926 transitions. Word has length 8 [2018-10-02 11:37:09,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:09,377 INFO L480 AbstractCegarLoop]: Abstraction has 1411 states and 4926 transitions. [2018-10-02 11:37:09,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:37:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 4926 transitions. [2018-10-02 11:37:09,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:37:09,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:09,379 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:09,379 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:09,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:09,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099334, now seen corresponding path program 1 times [2018-10-02 11:37:09,379 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:09,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:09,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:09,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:09,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:09,751 WARN L178 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2018-10-02 11:37:09,891 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-02 11:37:09,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:37:09,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:37:09,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:37:09,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:37:09,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:37:09,892 INFO L87 Difference]: Start difference. First operand 1411 states and 4926 transitions. Second operand 8 states. [2018-10-02 11:37:14,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:14,640 INFO L93 Difference]: Finished difference Result 2558 states and 7836 transitions. [2018-10-02 11:37:14,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 11:37:14,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:37:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:14,645 INFO L225 Difference]: With dead ends: 2558 [2018-10-02 11:37:14,645 INFO L226 Difference]: Without dead ends: 2552 [2018-10-02 11:37:14,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:37:14,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-10-02 11:37:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1471. [2018-10-02 11:37:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2018-10-02 11:37:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 5183 transitions. [2018-10-02 11:37:15,701 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 5183 transitions. Word has length 8 [2018-10-02 11:37:15,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:15,702 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 5183 transitions. [2018-10-02 11:37:15,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:37:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 5183 transitions. [2018-10-02 11:37:15,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:37:15,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:15,703 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:15,704 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:15,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:15,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099337, now seen corresponding path program 1 times [2018-10-02 11:37:15,704 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:15,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:15,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:15,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:15,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:15,854 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-02 11:37:15,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:37:15,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:37:15,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:37:15,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:37:15,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:37:15,855 INFO L87 Difference]: Start difference. First operand 1471 states and 5183 transitions. Second operand 8 states. [2018-10-02 11:37:15,994 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-02 11:37:20,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:20,774 INFO L93 Difference]: Finished difference Result 2703 states and 8278 transitions. [2018-10-02 11:37:20,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:37:20,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:37:20,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:20,780 INFO L225 Difference]: With dead ends: 2703 [2018-10-02 11:37:20,780 INFO L226 Difference]: Without dead ends: 2697 [2018-10-02 11:37:20,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:37:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2018-10-02 11:37:21,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1480. [2018-10-02 11:37:21,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-10-02 11:37:21,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5200 transitions. [2018-10-02 11:37:21,876 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5200 transitions. Word has length 8 [2018-10-02 11:37:21,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:21,876 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5200 transitions. [2018-10-02 11:37:21,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:37:21,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5200 transitions. [2018-10-02 11:37:21,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:37:21,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:21,878 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:21,878 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:21,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:21,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629971, now seen corresponding path program 1 times [2018-10-02 11:37:21,878 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:21,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:21,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:21,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:21,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:22,019 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-02 11:37:22,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:37:22,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:37:22,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:37:22,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:37:22,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:37:22,020 INFO L87 Difference]: Start difference. First operand 1480 states and 5200 transitions. Second operand 8 states. [2018-10-02 11:37:27,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:27,391 INFO L93 Difference]: Finished difference Result 2674 states and 8171 transitions. [2018-10-02 11:37:27,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:37:27,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:37:27,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:27,398 INFO L225 Difference]: With dead ends: 2674 [2018-10-02 11:37:27,398 INFO L226 Difference]: Without dead ends: 2668 [2018-10-02 11:37:27,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:37:27,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2018-10-02 11:37:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 1480. [2018-10-02 11:37:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-10-02 11:37:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5196 transitions. [2018-10-02 11:37:28,546 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5196 transitions. Word has length 8 [2018-10-02 11:37:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:28,546 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5196 transitions. [2018-10-02 11:37:28,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:37:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5196 transitions. [2018-10-02 11:37:28,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-02 11:37:28,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:28,548 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:28,548 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:28,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:28,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629974, now seen corresponding path program 1 times [2018-10-02 11:37:28,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:28,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:28,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:28,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:28,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:28,688 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-02 11:37:28,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:37:28,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:37:28,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:37:28,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:37:28,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:37:28,689 INFO L87 Difference]: Start difference. First operand 1480 states and 5196 transitions. Second operand 8 states. [2018-10-02 11:37:34,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:34,237 INFO L93 Difference]: Finished difference Result 2722 states and 8299 transitions. [2018-10-02 11:37:34,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-02 11:37:34,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-02 11:37:34,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:34,243 INFO L225 Difference]: With dead ends: 2722 [2018-10-02 11:37:34,243 INFO L226 Difference]: Without dead ends: 2716 [2018-10-02 11:37:34,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-10-02 11:37:34,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2018-10-02 11:37:35,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 1462. [2018-10-02 11:37:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2018-10-02 11:37:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 5124 transitions. [2018-10-02 11:37:35,453 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 5124 transitions. Word has length 8 [2018-10-02 11:37:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:35,454 INFO L480 AbstractCegarLoop]: Abstraction has 1462 states and 5124 transitions. [2018-10-02 11:37:35,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:37:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 5124 transitions. [2018-10-02 11:37:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:37:35,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:35,455 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:35,455 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:35,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:35,455 INFO L82 PathProgramCache]: Analyzing trace with hash 278041308, now seen corresponding path program 1 times [2018-10-02 11:37:35,455 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:35,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:35,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:35,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:35,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:35,945 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-02 11:37:35,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:37:35,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:37:35,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:37:35,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:37:35,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:37:35,946 INFO L87 Difference]: Start difference. First operand 1462 states and 5124 transitions. Second operand 8 states. [2018-10-02 11:37:41,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:41,045 INFO L93 Difference]: Finished difference Result 2962 states and 9218 transitions. [2018-10-02 11:37:41,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 11:37:41,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-02 11:37:41,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:41,051 INFO L225 Difference]: With dead ends: 2962 [2018-10-02 11:37:41,051 INFO L226 Difference]: Without dead ends: 2956 [2018-10-02 11:37:41,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:37:41,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2018-10-02 11:37:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1776. [2018-10-02 11:37:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-10-02 11:37:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 6236 transitions. [2018-10-02 11:37:42,513 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 6236 transitions. Word has length 9 [2018-10-02 11:37:42,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:42,513 INFO L480 AbstractCegarLoop]: Abstraction has 1776 states and 6236 transitions. [2018-10-02 11:37:42,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:37:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 6236 transitions. [2018-10-02 11:37:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:37:42,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:42,515 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:42,515 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:42,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:42,515 INFO L82 PathProgramCache]: Analyzing trace with hash 278041683, now seen corresponding path program 1 times [2018-10-02 11:37:42,515 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:42,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:42,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:42,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:42,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:42,586 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-02 11:37:42,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:37:42,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:37:42,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:37:42,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:37:42,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:37:42,588 INFO L87 Difference]: Start difference. First operand 1776 states and 6236 transitions. Second operand 8 states. [2018-10-02 11:37:47,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:47,765 INFO L93 Difference]: Finished difference Result 2948 states and 9162 transitions. [2018-10-02 11:37:47,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 11:37:47,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-02 11:37:47,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:47,772 INFO L225 Difference]: With dead ends: 2948 [2018-10-02 11:37:47,772 INFO L226 Difference]: Without dead ends: 2942 [2018-10-02 11:37:47,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:37:47,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2018-10-02 11:37:49,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1772. [2018-10-02 11:37:49,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-10-02 11:37:49,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 6220 transitions. [2018-10-02 11:37:49,298 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 6220 transitions. Word has length 9 [2018-10-02 11:37:49,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:49,298 INFO L480 AbstractCegarLoop]: Abstraction has 1772 states and 6220 transitions. [2018-10-02 11:37:49,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:37:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 6220 transitions. [2018-10-02 11:37:49,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:37:49,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:49,300 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:49,300 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:49,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:49,300 INFO L82 PathProgramCache]: Analyzing trace with hash 541105076, now seen corresponding path program 1 times [2018-10-02 11:37:49,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:49,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:49,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:49,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:49,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:49,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-02 11:37:49,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:37:49,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:37:49,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:37:49,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:37:49,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:37:49,436 INFO L87 Difference]: Start difference. First operand 1772 states and 6220 transitions. Second operand 8 states. [2018-10-02 11:37:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:55,591 INFO L93 Difference]: Finished difference Result 3238 states and 9970 transitions. [2018-10-02 11:37:55,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:37:55,591 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-02 11:37:55,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:55,597 INFO L225 Difference]: With dead ends: 3238 [2018-10-02 11:37:55,597 INFO L226 Difference]: Without dead ends: 3232 [2018-10-02 11:37:55,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:37:55,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2018-10-02 11:37:57,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1799. [2018-10-02 11:37:57,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-10-02 11:37:57,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 6288 transitions. [2018-10-02 11:37:57,201 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 6288 transitions. Word has length 9 [2018-10-02 11:37:57,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:57,201 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 6288 transitions. [2018-10-02 11:37:57,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:37:57,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 6288 transitions. [2018-10-02 11:37:57,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:37:57,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:57,203 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:57,203 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:57,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:57,203 INFO L82 PathProgramCache]: Analyzing trace with hash 541105451, now seen corresponding path program 1 times [2018-10-02 11:37:57,203 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:57,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:57,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:57,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:57,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:57,344 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-02 11:37:57,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:37:57,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:37:57,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:37:57,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:37:57,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:37:57,345 INFO L87 Difference]: Start difference. First operand 1799 states and 6288 transitions. Second operand 8 states. [2018-10-02 11:38:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:03,709 INFO L93 Difference]: Finished difference Result 3212 states and 9854 transitions. [2018-10-02 11:38:03,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:38:03,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-02 11:38:03,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:03,716 INFO L225 Difference]: With dead ends: 3212 [2018-10-02 11:38:03,717 INFO L226 Difference]: Without dead ends: 3206 [2018-10-02 11:38:03,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:38:03,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2018-10-02 11:38:05,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 1737. [2018-10-02 11:38:05,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2018-10-02 11:38:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 6062 transitions. [2018-10-02 11:38:05,308 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 6062 transitions. Word has length 9 [2018-10-02 11:38:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:05,308 INFO L480 AbstractCegarLoop]: Abstraction has 1737 states and 6062 transitions. [2018-10-02 11:38:05,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:38:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 6062 transitions. [2018-10-02 11:38:05,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:38:05,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:05,310 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:05,310 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:05,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:05,310 INFO L82 PathProgramCache]: Analyzing trace with hash 825189368, now seen corresponding path program 1 times [2018-10-02 11:38:05,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:05,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:05,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:05,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:05,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:05,397 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-02 11:38:05,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:38:05,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:38:05,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:38:05,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:38:05,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:38:05,398 INFO L87 Difference]: Start difference. First operand 1737 states and 6062 transitions. Second operand 8 states. [2018-10-02 11:38:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:11,333 INFO L93 Difference]: Finished difference Result 3315 states and 10043 transitions. [2018-10-02 11:38:11,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:38:11,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-02 11:38:11,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:11,340 INFO L225 Difference]: With dead ends: 3315 [2018-10-02 11:38:11,340 INFO L226 Difference]: Without dead ends: 3309 [2018-10-02 11:38:11,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:38:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2018-10-02 11:38:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 1985. [2018-10-02 11:38:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2018-10-02 11:38:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 6886 transitions. [2018-10-02 11:38:13,060 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 6886 transitions. Word has length 9 [2018-10-02 11:38:13,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:13,060 INFO L480 AbstractCegarLoop]: Abstraction has 1985 states and 6886 transitions. [2018-10-02 11:38:13,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:38:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 6886 transitions. [2018-10-02 11:38:13,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:38:13,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:13,062 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:13,062 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:13,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:13,062 INFO L82 PathProgramCache]: Analyzing trace with hash 825189371, now seen corresponding path program 1 times [2018-10-02 11:38:13,062 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:13,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:13,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:13,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:13,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:13,169 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-02 11:38:13,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:38:13,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:38:13,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:38:13,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:38:13,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:38:13,170 INFO L87 Difference]: Start difference. First operand 1985 states and 6886 transitions. Second operand 8 states. [2018-10-02 11:38:19,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:19,777 INFO L93 Difference]: Finished difference Result 3446 states and 10415 transitions. [2018-10-02 11:38:19,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:38:19,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-02 11:38:19,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:19,784 INFO L225 Difference]: With dead ends: 3446 [2018-10-02 11:38:19,784 INFO L226 Difference]: Without dead ends: 3440 [2018-10-02 11:38:19,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:38:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2018-10-02 11:38:21,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 1927. [2018-10-02 11:38:21,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1927 states. [2018-10-02 11:38:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 6663 transitions. [2018-10-02 11:38:21,667 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 6663 transitions. Word has length 9 [2018-10-02 11:38:21,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:21,667 INFO L480 AbstractCegarLoop]: Abstraction has 1927 states and 6663 transitions. [2018-10-02 11:38:21,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:38:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 6663 transitions. [2018-10-02 11:38:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:38:21,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:21,668 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:21,669 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:21,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:21,669 INFO L82 PathProgramCache]: Analyzing trace with hash 832700792, now seen corresponding path program 1 times [2018-10-02 11:38:21,669 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:21,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:21,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:21,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:38:21,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:38:21,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:38:21,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:38:21,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:38:21,738 INFO L87 Difference]: Start difference. First operand 1927 states and 6663 transitions. Second operand 8 states. [2018-10-02 11:38:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:27,330 INFO L93 Difference]: Finished difference Result 2832 states and 8631 transitions. [2018-10-02 11:38:27,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 11:38:27,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-02 11:38:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:27,336 INFO L225 Difference]: With dead ends: 2832 [2018-10-02 11:38:27,337 INFO L226 Difference]: Without dead ends: 2824 [2018-10-02 11:38:27,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:38:27,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2018-10-02 11:38:29,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 1904. [2018-10-02 11:38:29,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-10-02 11:38:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 6553 transitions. [2018-10-02 11:38:29,215 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 6553 transitions. Word has length 9 [2018-10-02 11:38:29,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:29,215 INFO L480 AbstractCegarLoop]: Abstraction has 1904 states and 6553 transitions. [2018-10-02 11:38:29,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:38:29,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 6553 transitions. [2018-10-02 11:38:29,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:38:29,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:29,216 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:29,217 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:29,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:29,217 INFO L82 PathProgramCache]: Analyzing trace with hash -595843680, now seen corresponding path program 1 times [2018-10-02 11:38:29,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:29,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:29,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:29,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:29,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:29,328 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-02 11:38:29,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:38:29,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:38:29,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:38:29,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:38:29,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:38:29,329 INFO L87 Difference]: Start difference. First operand 1904 states and 6553 transitions. Second operand 9 states. [2018-10-02 11:38:35,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:35,366 INFO L93 Difference]: Finished difference Result 3157 states and 9716 transitions. [2018-10-02 11:38:35,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 11:38:35,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-02 11:38:35,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:35,373 INFO L225 Difference]: With dead ends: 3157 [2018-10-02 11:38:35,373 INFO L226 Difference]: Without dead ends: 3151 [2018-10-02 11:38:35,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:38:35,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2018-10-02 11:38:37,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 1949. [2018-10-02 11:38:37,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2018-10-02 11:38:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 6722 transitions. [2018-10-02 11:38:37,400 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 6722 transitions. Word has length 9 [2018-10-02 11:38:37,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:37,401 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 6722 transitions. [2018-10-02 11:38:37,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:38:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 6722 transitions. [2018-10-02 11:38:37,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:38:37,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:37,402 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:37,402 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:37,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:37,403 INFO L82 PathProgramCache]: Analyzing trace with hash -595843677, now seen corresponding path program 1 times [2018-10-02 11:38:37,403 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:37,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:37,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:37,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:37,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:37,523 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-02 11:38:37,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:38:37,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:38:37,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:38:37,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:38:37,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:38:37,525 INFO L87 Difference]: Start difference. First operand 1949 states and 6722 transitions. Second operand 9 states. [2018-10-02 11:38:46,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:46,167 INFO L93 Difference]: Finished difference Result 3822 states and 11523 transitions. [2018-10-02 11:38:46,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 11:38:46,167 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-02 11:38:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:46,175 INFO L225 Difference]: With dead ends: 3822 [2018-10-02 11:38:46,175 INFO L226 Difference]: Without dead ends: 3816 [2018-10-02 11:38:46,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2018-10-02 11:38:46,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2018-10-02 11:38:48,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 2098. [2018-10-02 11:38:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-10-02 11:38:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 7405 transitions. [2018-10-02 11:38:48,387 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 7405 transitions. Word has length 9 [2018-10-02 11:38:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:48,387 INFO L480 AbstractCegarLoop]: Abstraction has 2098 states and 7405 transitions. [2018-10-02 11:38:48,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:38:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 7405 transitions. [2018-10-02 11:38:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:38:48,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:48,389 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:48,389 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:48,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:48,390 INFO L82 PathProgramCache]: Analyzing trace with hash -204435682, now seen corresponding path program 1 times [2018-10-02 11:38:48,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:48,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:48,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:48,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:48,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:48,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:38:48,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:38:48,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:38:48,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:38:48,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:38:48,513 INFO L87 Difference]: Start difference. First operand 2098 states and 7405 transitions. Second operand 9 states. [2018-10-02 11:38:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:57,820 INFO L93 Difference]: Finished difference Result 4144 states and 12499 transitions. [2018-10-02 11:38:57,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 11:38:57,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-02 11:38:57,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:57,828 INFO L225 Difference]: With dead ends: 4144 [2018-10-02 11:38:57,828 INFO L226 Difference]: Without dead ends: 4138 [2018-10-02 11:38:57,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2018-10-02 11:38:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2018-10-02 11:39:00,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 2260. [2018-10-02 11:39:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2018-10-02 11:39:00,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 7995 transitions. [2018-10-02 11:39:00,194 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 7995 transitions. Word has length 9 [2018-10-02 11:39:00,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:00,194 INFO L480 AbstractCegarLoop]: Abstraction has 2260 states and 7995 transitions. [2018-10-02 11:39:00,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:39:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 7995 transitions. [2018-10-02 11:39:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:39:00,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:00,195 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:39:00,196 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:00,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:00,196 INFO L82 PathProgramCache]: Analyzing trace with hash -204435307, now seen corresponding path program 1 times [2018-10-02 11:39:00,196 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:00,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:00,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:00,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:00,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:00,294 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-02 11:39:00,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:39:00,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:39:00,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:39:00,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:39:00,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:39:00,296 INFO L87 Difference]: Start difference. First operand 2260 states and 7995 transitions. Second operand 9 states. [2018-10-02 11:39:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:07,625 INFO L93 Difference]: Finished difference Result 3320 states and 10163 transitions. [2018-10-02 11:39:07,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 11:39:07,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-02 11:39:07,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:07,632 INFO L225 Difference]: With dead ends: 3320 [2018-10-02 11:39:07,632 INFO L226 Difference]: Without dead ends: 3314 [2018-10-02 11:39:07,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-10-02 11:39:07,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2018-10-02 11:39:10,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 2191. [2018-10-02 11:39:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2191 states. [2018-10-02 11:39:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 7721 transitions. [2018-10-02 11:39:10,293 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 7721 transitions. Word has length 9 [2018-10-02 11:39:10,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:10,293 INFO L480 AbstractCegarLoop]: Abstraction has 2191 states and 7721 transitions. [2018-10-02 11:39:10,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:39:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 7721 transitions. [2018-10-02 11:39:10,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:39:10,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:10,295 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:39:10,295 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:10,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:10,295 INFO L82 PathProgramCache]: Analyzing trace with hash -966522519, now seen corresponding path program 1 times [2018-10-02 11:39:10,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:10,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:10,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:10,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:10,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:39:10,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:39:10,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:39:10,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:39:10,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:39:10,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:39:10,412 INFO L87 Difference]: Start difference. First operand 2191 states and 7721 transitions. Second operand 8 states. [2018-10-02 11:39:19,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:19,975 INFO L93 Difference]: Finished difference Result 4113 states and 13014 transitions. [2018-10-02 11:39:19,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 11:39:19,975 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-10-02 11:39:19,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:19,984 INFO L225 Difference]: With dead ends: 4113 [2018-10-02 11:39:19,984 INFO L226 Difference]: Without dead ends: 4107 [2018-10-02 11:39:19,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:39:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2018-10-02 11:39:22,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 2224. [2018-10-02 11:39:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2018-10-02 11:39:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 7857 transitions. [2018-10-02 11:39:22,648 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 7857 transitions. Word has length 9 [2018-10-02 11:39:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:22,649 INFO L480 AbstractCegarLoop]: Abstraction has 2224 states and 7857 transitions. [2018-10-02 11:39:22,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:39:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 7857 transitions. [2018-10-02 11:39:22,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:39:22,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:22,650 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:39:22,650 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr5ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:22,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:22,651 INFO L82 PathProgramCache]: Analyzing trace with hash -966522144, now seen corresponding path program 1 times [2018-10-02 11:39:22,651 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:22,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:22,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:22,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:22,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:22,752 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-02 11:39:22,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:39:22,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-02 11:39:22,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:39:22,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:39:22,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:39:22,753 INFO L87 Difference]: Start difference. First operand 2224 states and 7857 transitions. Second operand 8 states. Received shutdown request... [2018-10-02 11:39:27,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:39:27,474 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 11:39:27,482 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 11:39:27,482 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:39:27 BoogieIcfgContainer [2018-10-02 11:39:27,482 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:39:27,483 INFO L168 Benchmark]: Toolchain (without parser) took 264153.27 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: -989.4 MB). Peak memory consumption was 702.0 MB. Max. memory is 7.1 GB. [2018-10-02 11:39:27,484 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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-02 11:39:27,484 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.46 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-02 11:39:27,485 INFO L168 Benchmark]: Boogie Preprocessor took 40.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:39:27,485 INFO L168 Benchmark]: RCFGBuilder took 1398.70 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-02 11:39:27,486 INFO L168 Benchmark]: TraceAbstraction took 262663.48 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 659.7 MB. Max. memory is 7.1 GB. [2018-10-02 11:39:27,488 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.21 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 43.46 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 40.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1398.70 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 262663.48 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 659.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 263]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 263). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 199). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 316]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 316). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 604]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 604). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 71). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 95). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 194]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 194). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 584]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 584). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 337). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 223]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 223). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 816]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 816). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 446]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 446). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 800]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 800). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 470]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 470). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 599]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 599). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 624]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 624). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 847]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1374 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 27 error locations. TIMEOUT Result, 262.5s OverallTime, 53 OverallIterations, 2 TraceHistogramMax, 210.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14915 SDtfs, 26502 SDslu, 28528 SDs, 0 SdLazy, 102061 SolverSat, 9490 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 100.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 821 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 817 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2149 ImplicationChecksByTransitivity, 18.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2260occurred in iteration=50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 41.6s AutomataMinimizationTime, 52 MinimizatonAttempts, 43801 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 428 NumberOfCodeBlocks, 428 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 375 ConstructedInterpolants, 0 QuantifiedInterpolants, 25219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 53 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-39-27-499.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-39-27-499.csv Completed graceful shutdown