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-4eac566 [2018-09-23 19:31:03,294 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 19:31:03,296 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 19:31:03,313 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 19:31:03,313 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 19:31:03,314 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 19:31:03,315 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 19:31:03,317 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 19:31:03,319 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 19:31:03,320 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 19:31:03,320 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 19:31:03,321 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 19:31:03,322 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 19:31:03,323 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 19:31:03,324 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 19:31:03,324 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 19:31:03,325 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 19:31:03,327 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 19:31:03,329 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 19:31:03,330 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 19:31:03,331 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 19:31:03,333 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 19:31:03,335 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 19:31:03,335 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 19:31:03,336 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 19:31:03,337 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 19:31:03,338 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 19:31:03,338 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 19:31:03,339 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 19:31:03,342 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 19:31:03,343 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 19:31:03,343 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 19:31:03,344 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 19:31:03,344 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 19:31:03,347 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 19:31:03,348 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 19:31:03,348 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-23 19:31:03,378 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 19:31:03,378 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 19:31:03,379 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 19:31:03,379 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 19:31:03,381 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 19:31:03,381 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 19:31:03,381 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 19:31:03,381 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 19:31:03,381 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 19:31:03,382 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 19:31:03,382 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 19:31:03,382 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 19:31:03,382 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 19:31:03,384 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 19:31:03,384 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 19:31:03,384 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 19:31:03,384 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 19:31:03,384 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 19:31:03,385 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 19:31:03,385 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 19:31:03,385 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 19:31:03,385 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 19:31:03,386 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:31:03,387 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 19:31:03,387 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 19:31:03,387 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 19:31:03,387 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 19:31:03,388 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 19:31:03,388 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 19:31:03,388 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 19:31:03,450 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 19:31:03,461 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 19:31:03,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 19:31:03,466 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 19:31:03,467 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 19:31:03,468 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl [2018-09-23 19:31:03,468 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-09-23 19:31:03,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 19:31:03,562 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 19:31:03,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 19:31:03,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 19:31:03,563 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 19:31:03,584 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 23.09 07:31:03" (1/1) ... [2018-09-23 19:31:03,604 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 23.09 07:31:03" (1/1) ... [2018-09-23 19:31:03,617 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-23 19:31:03,617 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-23 19:31:03,617 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-23 19:31:03,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 19:31:03,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 19:31:03,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 19:31:03,621 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 19:31:03,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:03" (1/1) ... [2018-09-23 19:31:03,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:03" (1/1) ... [2018-09-23 19:31:03,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:03" (1/1) ... [2018-09-23 19:31:03,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:03" (1/1) ... [2018-09-23 19:31:03,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:03" (1/1) ... [2018-09-23 19:31:03,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:03" (1/1) ... [2018-09-23 19:31:03,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:03" (1/1) ... [2018-09-23 19:31:03,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 19:31:03,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 19:31:03,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 19:31:03,693 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 19:31:03,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31: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-09-23 19:31:03,780 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-23 19:31:03,780 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-23 19:31:03,781 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-23 19:31:04,896 INFO L351 CfgBuilder]: Using library mode [2018-09-23 19:31:04,896 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:31:04 BoogieIcfgContainer [2018-09-23 19:31:04,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 19:31:04,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 19:31:04,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 19:31:04,901 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 19:31:04,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:03" (1/2) ... [2018-09-23 19:31:04,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2622c289 and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 07:31:04, skipping insertion in model container [2018-09-23 19:31:04,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:31:04" (2/2) ... [2018-09-23 19:31:04,905 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-09-23 19:31:04,914 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 19:31:04,923 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-09-23 19:31:04,975 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 19:31:04,976 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 19:31:04,976 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 19:31:04,976 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 19:31:04,976 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 19:31:04,977 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 19:31:04,977 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 19:31:04,977 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 19:31:04,977 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 19:31:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-09-23 19:31:05,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-23 19:31:05,005 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:05,006 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-23 19:31:05,008 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:05,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:05,016 INFO L82 PathProgramCache]: Analyzing trace with hash 45506320, now seen corresponding path program 1 times [2018-09-23 19:31:05,018 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:05,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:05,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:05,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:05,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:05,250 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:05,250 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:31:05,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 19:31:05,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 19:31:05,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:31:05,270 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 5 states. [2018-09-23 19:31:06,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:06,833 INFO L93 Difference]: Finished difference Result 142 states and 303 transitions. [2018-09-23 19:31:06,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 19:31:06,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-23 19:31:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:06,852 INFO L225 Difference]: With dead ends: 142 [2018-09-23 19:31:06,852 INFO L226 Difference]: Without dead ends: 138 [2018-09-23 19:31:06,856 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-09-23 19:31:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-23 19:31:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2018-09-23 19:31:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-23 19:31:06,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 219 transitions. [2018-09-23 19:31:06,916 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 219 transitions. Word has length 5 [2018-09-23 19:31:06,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:06,917 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 219 transitions. [2018-09-23 19:31:06,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 19:31:06,918 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 219 transitions. [2018-09-23 19:31:06,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-23 19:31:06,919 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:06,919 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-23 19:31:06,922 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:06,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:06,923 INFO L82 PathProgramCache]: Analyzing trace with hash 45756290, now seen corresponding path program 1 times [2018-09-23 19:31:06,923 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:06,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:06,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:06,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:06,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:07,095 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:07,096 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:31:07,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 19:31:07,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 19:31:07,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:31:07,099 INFO L87 Difference]: Start difference. First operand 98 states and 219 transitions. Second operand 5 states. [2018-09-23 19:31:08,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:08,509 INFO L93 Difference]: Finished difference Result 241 states and 539 transitions. [2018-09-23 19:31:08,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-23 19:31:08,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-23 19:31:08,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:08,515 INFO L225 Difference]: With dead ends: 241 [2018-09-23 19:31:08,516 INFO L226 Difference]: Without dead ends: 237 [2018-09-23 19:31:08,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:08,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-23 19:31:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 134. [2018-09-23 19:31:08,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-23 19:31:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2018-09-23 19:31:08,549 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 5 [2018-09-23 19:31:08,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:08,549 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2018-09-23 19:31:08,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 19:31:08,550 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2018-09-23 19:31:08,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-23 19:31:08,551 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:08,551 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-23 19:31:08,552 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:08,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:08,553 INFO L82 PathProgramCache]: Analyzing trace with hash 28948051, now seen corresponding path program 1 times [2018-09-23 19:31:08,553 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:08,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:08,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:08,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:08,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:08,658 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:08,658 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 19:31:08,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 19:31:08,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 19:31:08,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:31:08,659 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 5 states. [2018-09-23 19:31:09,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:09,899 INFO L93 Difference]: Finished difference Result 269 states and 639 transitions. [2018-09-23 19:31:09,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-23 19:31:09,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-23 19:31:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:09,904 INFO L225 Difference]: With dead ends: 269 [2018-09-23 19:31:09,904 INFO L226 Difference]: Without dead ends: 265 [2018-09-23 19:31:09,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-23 19:31:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 162. [2018-09-23 19:31:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-23 19:31:09,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 455 transitions. [2018-09-23 19:31:09,938 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 455 transitions. Word has length 5 [2018-09-23 19:31:09,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:09,938 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 455 transitions. [2018-09-23 19:31:09,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 19:31:09,938 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 455 transitions. [2018-09-23 19:31:09,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:31:09,940 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:09,940 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:09,941 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:09,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:09,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558066, now seen corresponding path program 1 times [2018-09-23 19:31:09,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:09,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:09,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:09,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:09,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:10,079 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:10,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:31:10,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:10,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:10,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:10,081 INFO L87 Difference]: Start difference. First operand 162 states and 455 transitions. Second operand 8 states. [2018-09-23 19:31:15,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:15,972 INFO L93 Difference]: Finished difference Result 790 states and 2085 transitions. [2018-09-23 19:31:15,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 19:31:15,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:31:15,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:15,980 INFO L225 Difference]: With dead ends: 790 [2018-09-23 19:31:15,981 INFO L226 Difference]: Without dead ends: 629 [2018-09-23 19:31:15,985 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-09-23 19:31:15,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-09-23 19:31:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 278. [2018-09-23 19:31:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-09-23 19:31:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 854 transitions. [2018-09-23 19:31:16,041 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 854 transitions. Word has length 8 [2018-09-23 19:31:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:16,041 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 854 transitions. [2018-09-23 19:31:16,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 854 transitions. [2018-09-23 19:31:16,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:31:16,047 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:16,047 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:16,048 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:16,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:16,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558063, now seen corresponding path program 1 times [2018-09-23 19:31:16,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:16,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:16,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:16,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:16,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:16,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-09-23 19:31:16,244 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:16,244 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:31:16,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:16,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:16,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:16,246 INFO L87 Difference]: Start difference. First operand 278 states and 854 transitions. Second operand 8 states. [2018-09-23 19:31:19,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:19,112 INFO L93 Difference]: Finished difference Result 634 states and 1540 transitions. [2018-09-23 19:31:19,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:31:19,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:31:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:19,118 INFO L225 Difference]: With dead ends: 634 [2018-09-23 19:31:19,118 INFO L226 Difference]: Without dead ends: 628 [2018-09-23 19:31:19,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:31:19,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-09-23 19:31:19,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 310. [2018-09-23 19:31:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-09-23 19:31:19,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 963 transitions. [2018-09-23 19:31:19,172 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 963 transitions. Word has length 8 [2018-09-23 19:31:19,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:19,172 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 963 transitions. [2018-09-23 19:31:19,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:19,173 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 963 transitions. [2018-09-23 19:31:19,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:31:19,175 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:19,175 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:19,176 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:19,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:19,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1080099218, now seen corresponding path program 1 times [2018-09-23 19:31:19,176 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:19,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:19,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:19,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:19,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:19,282 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:19,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:31:19,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:19,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:19,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:19,284 INFO L87 Difference]: Start difference. First operand 310 states and 963 transitions. Second operand 8 states. [2018-09-23 19:31:20,822 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-23 19:31:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:23,273 INFO L93 Difference]: Finished difference Result 768 states and 2087 transitions. [2018-09-23 19:31:23,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-23 19:31:23,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:31:23,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:23,278 INFO L225 Difference]: With dead ends: 768 [2018-09-23 19:31:23,278 INFO L226 Difference]: Without dead ends: 537 [2018-09-23 19:31:23,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:31:23,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-09-23 19:31:23,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 334. [2018-09-23 19:31:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-09-23 19:31:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1037 transitions. [2018-09-23 19:31:23,328 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1037 transitions. Word has length 8 [2018-09-23 19:31:23,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:23,329 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1037 transitions. [2018-09-23 19:31:23,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1037 transitions. [2018-09-23 19:31:23,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:31:23,331 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:23,331 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:23,332 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:23,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:23,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595081, now seen corresponding path program 1 times [2018-09-23 19:31:23,332 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:23,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:23,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:23,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:23,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:23,487 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:23,488 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:31:23,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:23,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:23,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:23,489 INFO L87 Difference]: Start difference. First operand 334 states and 1037 transitions. Second operand 8 states. [2018-09-23 19:31:26,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:26,178 INFO L93 Difference]: Finished difference Result 1145 states and 3146 transitions. [2018-09-23 19:31:26,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:31:26,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:31:26,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:26,185 INFO L225 Difference]: With dead ends: 1145 [2018-09-23 19:31:26,185 INFO L226 Difference]: Without dead ends: 812 [2018-09-23 19:31:26,187 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-09-23 19:31:26,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-09-23 19:31:26,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 450. [2018-09-23 19:31:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-09-23 19:31:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1432 transitions. [2018-09-23 19:31:26,255 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1432 transitions. Word has length 8 [2018-09-23 19:31:26,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:26,256 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1432 transitions. [2018-09-23 19:31:26,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:26,256 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1432 transitions. [2018-09-23 19:31:26,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:31:26,257 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:26,258 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:26,259 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:26,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:26,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595078, now seen corresponding path program 1 times [2018-09-23 19:31:26,259 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:26,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:26,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:26,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:26,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:26,364 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:26,364 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:31:26,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:26,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:26,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:26,366 INFO L87 Difference]: Start difference. First operand 450 states and 1432 transitions. Second operand 8 states. [2018-09-23 19:31:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:28,484 INFO L93 Difference]: Finished difference Result 877 states and 2260 transitions. [2018-09-23 19:31:28,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 19:31:28,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:31:28,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:28,490 INFO L225 Difference]: With dead ends: 877 [2018-09-23 19:31:28,490 INFO L226 Difference]: Without dead ends: 871 [2018-09-23 19:31:28,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-09-23 19:31:28,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-09-23 19:31:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 478. [2018-09-23 19:31:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-09-23 19:31:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1531 transitions. [2018-09-23 19:31:28,577 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1531 transitions. Word has length 8 [2018-09-23 19:31:28,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:28,578 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 1531 transitions. [2018-09-23 19:31:28,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:28,578 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1531 transitions. [2018-09-23 19:31:28,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:31:28,579 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:28,579 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:28,580 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:28,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:28,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064444, now seen corresponding path program 1 times [2018-09-23 19:31:28,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:28,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:28,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:28,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:28,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:28,778 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:28,778 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:31:28,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:28,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:28,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:28,780 INFO L87 Difference]: Start difference. First operand 478 states and 1531 transitions. Second operand 8 states. [2018-09-23 19:31:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:30,937 INFO L93 Difference]: Finished difference Result 1049 states and 2854 transitions. [2018-09-23 19:31:30,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-23 19:31:30,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:31:30,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:30,942 INFO L225 Difference]: With dead ends: 1049 [2018-09-23 19:31:30,943 INFO L226 Difference]: Without dead ends: 818 [2018-09-23 19:31:30,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:31:30,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-09-23 19:31:31,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 524. [2018-09-23 19:31:31,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-09-23 19:31:31,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1684 transitions. [2018-09-23 19:31:31,048 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1684 transitions. Word has length 8 [2018-09-23 19:31:31,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:31,048 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 1684 transitions. [2018-09-23 19:31:31,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:31,048 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1684 transitions. [2018-09-23 19:31:31,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:31:31,049 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:31,049 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:31,050 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:31,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:31,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064441, now seen corresponding path program 1 times [2018-09-23 19:31:31,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:31,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:31,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:31,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:31,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:31,174 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:31,174 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:31:31,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:31,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:31,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:31,175 INFO L87 Difference]: Start difference. First operand 524 states and 1684 transitions. Second operand 8 states. [2018-09-23 19:31:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:32,770 INFO L93 Difference]: Finished difference Result 733 states and 1997 transitions. [2018-09-23 19:31:32,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-23 19:31:32,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:31:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:32,776 INFO L225 Difference]: With dead ends: 733 [2018-09-23 19:31:32,777 INFO L226 Difference]: Without dead ends: 727 [2018-09-23 19:31:32,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:31:32,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-09-23 19:31:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 530. [2018-09-23 19:31:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-09-23 19:31:32,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1690 transitions. [2018-09-23 19:31:32,899 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1690 transitions. Word has length 8 [2018-09-23 19:31:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:32,900 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1690 transitions. [2018-09-23 19:31:32,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:32,900 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1690 transitions. [2018-09-23 19:31:32,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:31:32,901 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:32,901 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:32,902 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:32,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:32,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656691, now seen corresponding path program 1 times [2018-09-23 19:31:32,903 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:32,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:32,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:32,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:32,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:33,379 WARN L178 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-09-23 19:31:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:33,410 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:33,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:31:33,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:33,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:33,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:33,411 INFO L87 Difference]: Start difference. First operand 530 states and 1690 transitions. Second operand 8 states. [2018-09-23 19:31:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:36,561 INFO L93 Difference]: Finished difference Result 1329 states and 3609 transitions. [2018-09-23 19:31:36,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-23 19:31:36,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:31:36,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:36,570 INFO L225 Difference]: With dead ends: 1329 [2018-09-23 19:31:36,570 INFO L226 Difference]: Without dead ends: 1323 [2018-09-23 19:31:36,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-09-23 19:31:36,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-09-23 19:31:36,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 626. [2018-09-23 19:31:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-09-23 19:31:36,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 2087 transitions. [2018-09-23 19:31:36,739 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 2087 transitions. Word has length 8 [2018-09-23 19:31:36,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:36,739 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 2087 transitions. [2018-09-23 19:31:36,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:36,740 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 2087 transitions. [2018-09-23 19:31:36,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:31:36,741 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:36,741 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:36,742 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:36,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:36,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656688, now seen corresponding path program 1 times [2018-09-23 19:31:36,742 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:36,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:36,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:36,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:36,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:36,947 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:36,948 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:31:36,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:36,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:36,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:36,949 INFO L87 Difference]: Start difference. First operand 626 states and 2087 transitions. Second operand 8 states. [2018-09-23 19:31:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:39,285 INFO L93 Difference]: Finished difference Result 1268 states and 3539 transitions. [2018-09-23 19:31:39,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-23 19:31:39,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:31:39,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:39,293 INFO L225 Difference]: With dead ends: 1268 [2018-09-23 19:31:39,294 INFO L226 Difference]: Without dead ends: 1262 [2018-09-23 19:31:39,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-09-23 19:31:39,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-09-23 19:31:39,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 618. [2018-09-23 19:31:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-09-23 19:31:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2056 transitions. [2018-09-23 19:31:39,474 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2056 transitions. Word has length 8 [2018-09-23 19:31:39,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:39,474 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 2056 transitions. [2018-09-23 19:31:39,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:39,475 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2056 transitions. [2018-09-23 19:31:39,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:31:39,476 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:39,476 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:39,477 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:39,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:39,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285639, now seen corresponding path program 1 times [2018-09-23 19:31:39,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:39,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:39,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:39,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:39,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:39,588 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:39,588 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:31:39,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:39,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:39,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:39,589 INFO L87 Difference]: Start difference. First operand 618 states and 2056 transitions. Second operand 8 states. [2018-09-23 19:31:42,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:42,149 INFO L93 Difference]: Finished difference Result 1367 states and 3876 transitions. [2018-09-23 19:31:42,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-23 19:31:42,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:31:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:42,157 INFO L225 Difference]: With dead ends: 1367 [2018-09-23 19:31:42,157 INFO L226 Difference]: Without dead ends: 1361 [2018-09-23 19:31:42,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-09-23 19:31:42,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-09-23 19:31:42,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 671. [2018-09-23 19:31:42,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-09-23 19:31:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2249 transitions. [2018-09-23 19:31:42,353 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2249 transitions. Word has length 8 [2018-09-23 19:31:42,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:42,353 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 2249 transitions. [2018-09-23 19:31:42,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:42,353 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2249 transitions. [2018-09-23 19:31:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:31:42,354 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:42,354 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:42,355 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:42,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:42,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285636, now seen corresponding path program 1 times [2018-09-23 19:31:42,355 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:42,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:42,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:42,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:42,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:42,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:42,463 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:42,463 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:31:42,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:42,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:42,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:42,464 INFO L87 Difference]: Start difference. First operand 671 states and 2249 transitions. Second operand 8 states. [2018-09-23 19:31:45,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:45,604 INFO L93 Difference]: Finished difference Result 1373 states and 3787 transitions. [2018-09-23 19:31:45,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 19:31:45,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:31:45,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:45,611 INFO L225 Difference]: With dead ends: 1373 [2018-09-23 19:31:45,611 INFO L226 Difference]: Without dead ends: 1367 [2018-09-23 19:31:45,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2018-09-23 19:31:45,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-09-23 19:31:45,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 698. [2018-09-23 19:31:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-09-23 19:31:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2344 transitions. [2018-09-23 19:31:45,820 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2344 transitions. Word has length 8 [2018-09-23 19:31:45,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:45,820 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 2344 transitions. [2018-09-23 19:31:45,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:45,820 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2344 transitions. [2018-09-23 19:31:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:31:45,821 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:45,821 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:45,822 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:45,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:45,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280348, now seen corresponding path program 1 times [2018-09-23 19:31:45,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:45,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:45,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:45,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:45,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:45,965 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:45,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 19:31:45,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:31:45,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:31:45,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:31:45,966 INFO L87 Difference]: Start difference. First operand 698 states and 2344 transitions. Second operand 7 states. [2018-09-23 19:31:48,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:48,040 INFO L93 Difference]: Finished difference Result 1526 states and 4298 transitions. [2018-09-23 19:31:48,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 19:31:48,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 19:31:48,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:48,050 INFO L225 Difference]: With dead ends: 1526 [2018-09-23 19:31:48,051 INFO L226 Difference]: Without dead ends: 1520 [2018-09-23 19:31:48,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:31:48,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-09-23 19:31:48,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 789. [2018-09-23 19:31:48,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-09-23 19:31:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2673 transitions. [2018-09-23 19:31:48,294 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2673 transitions. Word has length 8 [2018-09-23 19:31:48,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:48,294 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 2673 transitions. [2018-09-23 19:31:48,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:31:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2673 transitions. [2018-09-23 19:31:48,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:31:48,296 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:48,296 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:48,297 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:48,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:48,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280221, now seen corresponding path program 1 times [2018-09-23 19:31:48,297 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:48,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:48,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:48,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:48,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:48,403 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:48,404 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 19:31:48,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:31:48,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:31:48,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:31:48,405 INFO L87 Difference]: Start difference. First operand 789 states and 2673 transitions. Second operand 7 states. [2018-09-23 19:31:50,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:50,588 INFO L93 Difference]: Finished difference Result 1548 states and 4356 transitions. [2018-09-23 19:31:50,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:31:50,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 19:31:50,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:50,596 INFO L225 Difference]: With dead ends: 1548 [2018-09-23 19:31:50,596 INFO L226 Difference]: Without dead ends: 1542 [2018-09-23 19:31:50,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:31:50,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-09-23 19:31:50,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 821. [2018-09-23 19:31:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-09-23 19:31:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2801 transitions. [2018-09-23 19:31:50,824 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2801 transitions. Word has length 8 [2018-09-23 19:31:50,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:50,824 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 2801 transitions. [2018-09-23 19:31:50,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:31:50,824 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2801 transitions. [2018-09-23 19:31:50,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:31:50,825 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:50,825 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:50,826 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:50,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:50,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878937, now seen corresponding path program 1 times [2018-09-23 19:31:50,826 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:50,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:50,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:50,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:50,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:50,986 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:50,986 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 19:31:50,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:31:50,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:31:50,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:31:50,987 INFO L87 Difference]: Start difference. First operand 821 states and 2801 transitions. Second operand 7 states. [2018-09-23 19:31:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:53,300 INFO L93 Difference]: Finished difference Result 1575 states and 4539 transitions. [2018-09-23 19:31:53,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 19:31:53,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 19:31:53,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:53,309 INFO L225 Difference]: With dead ends: 1575 [2018-09-23 19:31:53,309 INFO L226 Difference]: Without dead ends: 1569 [2018-09-23 19:31:53,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:31:53,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-09-23 19:31:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 849. [2018-09-23 19:31:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-09-23 19:31:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2913 transitions. [2018-09-23 19:31:53,584 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2913 transitions. Word has length 8 [2018-09-23 19:31:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:53,584 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 2913 transitions. [2018-09-23 19:31:53,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:31:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2913 transitions. [2018-09-23 19:31:53,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:31:53,585 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:53,585 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:53,586 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:53,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:53,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878810, now seen corresponding path program 1 times [2018-09-23 19:31:53,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:53,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:53,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:53,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:53,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:53,696 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:53,697 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 19:31:53,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:31:53,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:31:53,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:31:53,698 INFO L87 Difference]: Start difference. First operand 849 states and 2913 transitions. Second operand 7 states. [2018-09-23 19:31:55,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:55,801 INFO L93 Difference]: Finished difference Result 1597 states and 4579 transitions. [2018-09-23 19:31:55,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-23 19:31:55,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 19:31:55,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:55,812 INFO L225 Difference]: With dead ends: 1597 [2018-09-23 19:31:55,812 INFO L226 Difference]: Without dead ends: 1591 [2018-09-23 19:31:55,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-09-23 19:31:55,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-09-23 19:31:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 873. [2018-09-23 19:31:56,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-09-23 19:31:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2993 transitions. [2018-09-23 19:31:56,075 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2993 transitions. Word has length 8 [2018-09-23 19:31:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:56,075 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 2993 transitions. [2018-09-23 19:31:56,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:31:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2993 transitions. [2018-09-23 19:31:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:31:56,076 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:56,077 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:56,077 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:56,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:56,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288024, now seen corresponding path program 1 times [2018-09-23 19:31:56,078 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:56,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:56,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:56,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:56,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:56,263 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:56,264 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 19:31:56,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:31:56,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:31:56,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:31:56,265 INFO L87 Difference]: Start difference. First operand 873 states and 2993 transitions. Second operand 7 states. [2018-09-23 19:31:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:58,385 INFO L93 Difference]: Finished difference Result 1726 states and 5211 transitions. [2018-09-23 19:31:58,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-23 19:31:58,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 19:31:58,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:58,395 INFO L225 Difference]: With dead ends: 1726 [2018-09-23 19:31:58,395 INFO L226 Difference]: Without dead ends: 1720 [2018-09-23 19:31:58,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-09-23 19:31:58,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2018-09-23 19:31:58,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1006. [2018-09-23 19:31:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-09-23 19:31:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3474 transitions. [2018-09-23 19:31:58,722 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3474 transitions. Word has length 8 [2018-09-23 19:31:58,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:58,722 INFO L480 AbstractCegarLoop]: Abstraction has 1006 states and 3474 transitions. [2018-09-23 19:31:58,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:31:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3474 transitions. [2018-09-23 19:31:58,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:31:58,723 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:58,723 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:58,723 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:58,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:58,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288027, now seen corresponding path program 1 times [2018-09-23 19:31:58,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:58,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:58,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:58,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:58,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:58,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:58,992 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:58,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 19:31:58,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:31:58,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:31:58,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:31:58,994 INFO L87 Difference]: Start difference. First operand 1006 states and 3474 transitions. Second operand 7 states. [2018-09-23 19:32:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:01,431 INFO L93 Difference]: Finished difference Result 1758 states and 5203 transitions. [2018-09-23 19:32:01,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-23 19:32:01,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 19:32:01,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:01,438 INFO L225 Difference]: With dead ends: 1758 [2018-09-23 19:32:01,438 INFO L226 Difference]: Without dead ends: 1752 [2018-09-23 19:32:01,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-09-23 19:32:01,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-09-23 19:32:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1011. [2018-09-23 19:32:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-09-23 19:32:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3493 transitions. [2018-09-23 19:32:01,768 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3493 transitions. Word has length 8 [2018-09-23 19:32:01,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:01,769 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 3493 transitions. [2018-09-23 19:32:01,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:32:01,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3493 transitions. [2018-09-23 19:32:01,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:32:01,770 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:01,770 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:01,770 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:01,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:01,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746872, now seen corresponding path program 1 times [2018-09-23 19:32:01,770 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:01,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:01,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:01,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:01,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:01,869 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:01,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 19:32:01,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:32:01,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:32:01,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:32:01,870 INFO L87 Difference]: Start difference. First operand 1011 states and 3493 transitions. Second operand 7 states. [2018-09-23 19:32:04,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:04,672 INFO L93 Difference]: Finished difference Result 1867 states and 5608 transitions. [2018-09-23 19:32:04,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 19:32:04,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 19:32:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:04,680 INFO L225 Difference]: With dead ends: 1867 [2018-09-23 19:32:04,680 INFO L226 Difference]: Without dead ends: 1861 [2018-09-23 19:32:04,681 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-09-23 19:32:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2018-09-23 19:32:05,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1119. [2018-09-23 19:32:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-09-23 19:32:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3931 transitions. [2018-09-23 19:32:05,063 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3931 transitions. Word has length 8 [2018-09-23 19:32:05,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:05,064 INFO L480 AbstractCegarLoop]: Abstraction has 1119 states and 3931 transitions. [2018-09-23 19:32:05,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:32:05,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3931 transitions. [2018-09-23 19:32:05,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:32:05,065 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:05,065 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:05,065 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:05,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:05,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746875, now seen corresponding path program 1 times [2018-09-23 19:32:05,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:05,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:05,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:05,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:05,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:05,202 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:05,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 19:32:05,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:32:05,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:32:05,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:32:05,203 INFO L87 Difference]: Start difference. First operand 1119 states and 3931 transitions. Second operand 7 states. [2018-09-23 19:32:08,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:08,317 INFO L93 Difference]: Finished difference Result 1968 states and 5829 transitions. [2018-09-23 19:32:08,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 19:32:08,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 19:32:08,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:08,331 INFO L225 Difference]: With dead ends: 1968 [2018-09-23 19:32:08,331 INFO L226 Difference]: Without dead ends: 1962 [2018-09-23 19:32:08,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:32:08,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-09-23 19:32:08,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1111. [2018-09-23 19:32:08,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-09-23 19:32:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3891 transitions. [2018-09-23 19:32:08,872 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3891 transitions. Word has length 8 [2018-09-23 19:32:08,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:08,872 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 3891 transitions. [2018-09-23 19:32:08,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:32:08,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3891 transitions. [2018-09-23 19:32:08,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:32:08,873 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:08,873 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:08,873 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:08,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:08,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1616407055, now seen corresponding path program 1 times [2018-09-23 19:32:08,873 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:08,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:08,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:08,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:08,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:08,994 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:08,995 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 19:32:08,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:32:08,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:32:08,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:32:08,996 INFO L87 Difference]: Start difference. First operand 1111 states and 3891 transitions. Second operand 7 states. [2018-09-23 19:32:11,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:11,753 INFO L93 Difference]: Finished difference Result 2001 states and 6001 transitions. [2018-09-23 19:32:11,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 19:32:11,755 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 19:32:11,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:11,763 INFO L225 Difference]: With dead ends: 2001 [2018-09-23 19:32:11,763 INFO L226 Difference]: Without dead ends: 1995 [2018-09-23 19:32:11,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:32:11,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-09-23 19:32:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1117. [2018-09-23 19:32:12,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-09-23 19:32:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 3909 transitions. [2018-09-23 19:32:12,330 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 3909 transitions. Word has length 8 [2018-09-23 19:32:12,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:12,331 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 3909 transitions. [2018-09-23 19:32:12,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:32:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 3909 transitions. [2018-09-23 19:32:12,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:32:12,332 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:12,332 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:12,335 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:12,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:12,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1616406928, now seen corresponding path program 1 times [2018-09-23 19:32:12,336 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:12,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:12,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:12,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:12,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:12,403 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:12,403 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 19:32:12,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:32:12,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:32:12,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:32:12,405 INFO L87 Difference]: Start difference. First operand 1117 states and 3909 transitions. Second operand 7 states. [2018-09-23 19:32:14,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:14,879 INFO L93 Difference]: Finished difference Result 1708 states and 5233 transitions. [2018-09-23 19:32:14,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-23 19:32:14,879 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 19:32:14,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:14,883 INFO L225 Difference]: With dead ends: 1708 [2018-09-23 19:32:14,883 INFO L226 Difference]: Without dead ends: 1702 [2018-09-23 19:32:14,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-09-23 19:32:14,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-09-23 19:32:15,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1210. [2018-09-23 19:32:15,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2018-09-23 19:32:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4307 transitions. [2018-09-23 19:32:15,363 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 4307 transitions. Word has length 8 [2018-09-23 19:32:15,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:15,363 INFO L480 AbstractCegarLoop]: Abstraction has 1210 states and 4307 transitions. [2018-09-23 19:32:15,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:32:15,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 4307 transitions. [2018-09-23 19:32:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:32:15,365 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:15,365 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:15,365 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:15,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:15,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256941, now seen corresponding path program 1 times [2018-09-23 19:32:15,366 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:15,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:15,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:15,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:15,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:15,470 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:15,470 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 19:32:15,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:32:15,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:32:15,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:32:15,471 INFO L87 Difference]: Start difference. First operand 1210 states and 4307 transitions. Second operand 7 states. [2018-09-23 19:32:18,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:18,956 INFO L93 Difference]: Finished difference Result 2402 states and 7321 transitions. [2018-09-23 19:32:18,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:32:18,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 19:32:18,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:18,961 INFO L225 Difference]: With dead ends: 2402 [2018-09-23 19:32:18,961 INFO L226 Difference]: Without dead ends: 2396 [2018-09-23 19:32:18,962 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-09-23 19:32:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-09-23 19:32:19,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1341. [2018-09-23 19:32:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-09-23 19:32:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4862 transitions. [2018-09-23 19:32:19,518 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4862 transitions. Word has length 8 [2018-09-23 19:32:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:19,518 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4862 transitions. [2018-09-23 19:32:19,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:32:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4862 transitions. [2018-09-23 19:32:19,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:32:19,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:19,520 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:19,520 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:19,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:19,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256944, now seen corresponding path program 1 times [2018-09-23 19:32:19,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:19,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:19,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:19,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:19,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:19,616 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:19,616 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 19:32:19,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:32:19,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:32:19,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:32:19,617 INFO L87 Difference]: Start difference. First operand 1341 states and 4862 transitions. Second operand 7 states. [2018-09-23 19:32:22,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:22,749 INFO L93 Difference]: Finished difference Result 2274 states and 6934 transitions. [2018-09-23 19:32:22,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 19:32:22,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-23 19:32:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:22,754 INFO L225 Difference]: With dead ends: 2274 [2018-09-23 19:32:22,754 INFO L226 Difference]: Without dead ends: 2268 [2018-09-23 19:32:22,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:32:22,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2018-09-23 19:32:23,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1337. [2018-09-23 19:32:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-09-23 19:32:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 4840 transitions. [2018-09-23 19:32:23,387 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 4840 transitions. Word has length 8 [2018-09-23 19:32:23,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:23,387 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 4840 transitions. [2018-09-23 19:32:23,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:32:23,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 4840 transitions. [2018-09-23 19:32:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:32:23,388 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:23,388 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-23 19:32:23,388 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:23,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:23,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1621267991, now seen corresponding path program 1 times [2018-09-23 19:32:23,389 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:23,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:23,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:23,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:23,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:23,439 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:23,439 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 19:32:23,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 19:32:23,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 19:32:23,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-23 19:32:23,440 INFO L87 Difference]: Start difference. First operand 1337 states and 4840 transitions. Second operand 4 states. [2018-09-23 19:32:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:24,412 INFO L93 Difference]: Finished difference Result 2170 states and 7637 transitions. [2018-09-23 19:32:24,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-23 19:32:24,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-23 19:32:24,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:24,421 INFO L225 Difference]: With dead ends: 2170 [2018-09-23 19:32:24,421 INFO L226 Difference]: Without dead ends: 1253 [2018-09-23 19:32:24,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-23 19:32:24,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-09-23 19:32:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1080. [2018-09-23 19:32:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-09-23 19:32:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3769 transitions. [2018-09-23 19:32:24,906 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3769 transitions. Word has length 8 [2018-09-23 19:32:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:24,907 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 3769 transitions. [2018-09-23 19:32:24,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 19:32:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3769 transitions. [2018-09-23 19:32:24,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:32:24,908 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:24,908 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:24,909 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:24,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:24,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283460, now seen corresponding path program 1 times [2018-09-23 19:32:24,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:24,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:24,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:24,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:24,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:25,079 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:25,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:32:25,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:25,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:25,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:25,080 INFO L87 Difference]: Start difference. First operand 1080 states and 3769 transitions. Second operand 8 states. [2018-09-23 19:32:28,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:28,850 INFO L93 Difference]: Finished difference Result 2095 states and 6316 transitions. [2018-09-23 19:32:28,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 19:32:28,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:32:28,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:28,854 INFO L225 Difference]: With dead ends: 2095 [2018-09-23 19:32:28,854 INFO L226 Difference]: Without dead ends: 2093 [2018-09-23 19:32:28,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-09-23 19:32:28,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-09-23 19:32:29,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1161. [2018-09-23 19:32:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2018-09-23 19:32:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 4123 transitions. [2018-09-23 19:32:29,398 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 4123 transitions. Word has length 8 [2018-09-23 19:32:29,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:29,398 INFO L480 AbstractCegarLoop]: Abstraction has 1161 states and 4123 transitions. [2018-09-23 19:32:29,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:29,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 4123 transitions. [2018-09-23 19:32:29,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:32:29,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:29,399 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:29,399 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:29,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:29,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283333, now seen corresponding path program 1 times [2018-09-23 19:32:29,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:29,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:29,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:29,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:29,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:29,829 WARN L178 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-09-23 19:32:30,232 WARN L178 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-09-23 19:32:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:30,446 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:30,447 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:32:30,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:30,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:30,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:30,448 INFO L87 Difference]: Start difference. First operand 1161 states and 4123 transitions. Second operand 8 states. [2018-09-23 19:32:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:34,157 INFO L93 Difference]: Finished difference Result 1994 states and 5988 transitions. [2018-09-23 19:32:34,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:32:34,158 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:32:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:34,162 INFO L225 Difference]: With dead ends: 1994 [2018-09-23 19:32:34,162 INFO L226 Difference]: Without dead ends: 1988 [2018-09-23 19:32:34,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:32:34,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-09-23 19:32:34,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1152. [2018-09-23 19:32:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-09-23 19:32:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 4099 transitions. [2018-09-23 19:32:34,804 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 4099 transitions. Word has length 8 [2018-09-23 19:32:34,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:34,805 INFO L480 AbstractCegarLoop]: Abstraction has 1152 states and 4099 transitions. [2018-09-23 19:32:34,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:34,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 4099 transitions. [2018-09-23 19:32:34,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:32:34,806 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:34,806 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:34,807 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:34,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:34,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1867882049, now seen corresponding path program 1 times [2018-09-23 19:32:34,807 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:34,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:34,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:34,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:34,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:34,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:34,918 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:34,918 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:32:34,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:34,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:34,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:34,919 INFO L87 Difference]: Start difference. First operand 1152 states and 4099 transitions. Second operand 8 states. [2018-09-23 19:32:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:39,201 INFO L93 Difference]: Finished difference Result 2160 states and 6516 transitions. [2018-09-23 19:32:39,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:32:39,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:32:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:39,206 INFO L225 Difference]: With dead ends: 2160 [2018-09-23 19:32:39,206 INFO L226 Difference]: Without dead ends: 2154 [2018-09-23 19:32:39,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2018-09-23 19:32:39,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2018-09-23 19:32:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1174. [2018-09-23 19:32:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-09-23 19:32:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4164 transitions. [2018-09-23 19:32:39,805 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 4164 transitions. Word has length 8 [2018-09-23 19:32:39,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:39,805 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 4164 transitions. [2018-09-23 19:32:39,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:39,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 4164 transitions. [2018-09-23 19:32:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:32:39,806 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:39,806 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:39,807 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:39,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:39,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1867881922, now seen corresponding path program 1 times [2018-09-23 19:32:39,807 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:39,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:39,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:39,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:39,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:39,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:39,941 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:39,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:32:39,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:39,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:39,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:39,942 INFO L87 Difference]: Start difference. First operand 1174 states and 4164 transitions. Second operand 8 states. [2018-09-23 19:32:44,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:44,180 INFO L93 Difference]: Finished difference Result 2094 states and 6271 transitions. [2018-09-23 19:32:44,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:32:44,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:32:44,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:44,184 INFO L225 Difference]: With dead ends: 2094 [2018-09-23 19:32:44,184 INFO L226 Difference]: Without dead ends: 2088 [2018-09-23 19:32:44,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:32:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2018-09-23 19:32:44,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1153. [2018-09-23 19:32:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-09-23 19:32:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 4095 transitions. [2018-09-23 19:32:44,790 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 4095 transitions. Word has length 8 [2018-09-23 19:32:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:44,790 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 4095 transitions. [2018-09-23 19:32:44,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 4095 transitions. [2018-09-23 19:32:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:32:44,791 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:44,791 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-23 19:32:44,792 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:44,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:44,792 INFO L82 PathProgramCache]: Analyzing trace with hash -896988374, now seen corresponding path program 1 times [2018-09-23 19:32:44,792 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:44,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:44,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:44,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:44,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:44,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:44,826 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:44,827 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 19:32:44,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 19:32:44,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 19:32:44,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-23 19:32:44,827 INFO L87 Difference]: Start difference. First operand 1153 states and 4095 transitions. Second operand 4 states. [2018-09-23 19:32:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:45,792 INFO L93 Difference]: Finished difference Result 1929 states and 6604 transitions. [2018-09-23 19:32:45,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-23 19:32:45,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-23 19:32:45,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:45,795 INFO L225 Difference]: With dead ends: 1929 [2018-09-23 19:32:45,795 INFO L226 Difference]: Without dead ends: 1400 [2018-09-23 19:32:45,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-23 19:32:45,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2018-09-23 19:32:46,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1083. [2018-09-23 19:32:46,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2018-09-23 19:32:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3765 transitions. [2018-09-23 19:32:46,583 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 3765 transitions. Word has length 8 [2018-09-23 19:32:46,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:46,583 INFO L480 AbstractCegarLoop]: Abstraction has 1083 states and 3765 transitions. [2018-09-23 19:32:46,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 19:32:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 3765 transitions. [2018-09-23 19:32:46,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:32:46,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:46,584 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:46,584 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:46,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:46,585 INFO L82 PathProgramCache]: Analyzing trace with hash -896379114, now seen corresponding path program 1 times [2018-09-23 19:32:46,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:46,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:46,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:46,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:46,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:46,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:46,684 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:46,685 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:32:46,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:46,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:46,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:46,686 INFO L87 Difference]: Start difference. First operand 1083 states and 3765 transitions. Second operand 8 states. [2018-09-23 19:32:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:50,535 INFO L93 Difference]: Finished difference Result 2276 states and 6948 transitions. [2018-09-23 19:32:50,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 19:32:50,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:32:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:50,540 INFO L225 Difference]: With dead ends: 2276 [2018-09-23 19:32:50,541 INFO L226 Difference]: Without dead ends: 2270 [2018-09-23 19:32:50,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-09-23 19:32:50,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2018-09-23 19:32:51,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1266. [2018-09-23 19:32:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2018-09-23 19:32:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4418 transitions. [2018-09-23 19:32:51,274 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 4418 transitions. Word has length 8 [2018-09-23 19:32:51,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:51,274 INFO L480 AbstractCegarLoop]: Abstraction has 1266 states and 4418 transitions. [2018-09-23 19:32:51,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 4418 transitions. [2018-09-23 19:32:51,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:32:51,276 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:51,276 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:51,276 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:51,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:51,276 INFO L82 PathProgramCache]: Analyzing trace with hash -896379111, now seen corresponding path program 1 times [2018-09-23 19:32:51,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:51,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:51,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:51,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:51,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:51,361 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:51,361 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:32:51,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:51,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:51,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:51,362 INFO L87 Difference]: Start difference. First operand 1266 states and 4418 transitions. Second operand 8 states. [2018-09-23 19:32:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:55,650 INFO L93 Difference]: Finished difference Result 2425 states and 7363 transitions. [2018-09-23 19:32:55,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:32:55,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:32:55,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:55,656 INFO L225 Difference]: With dead ends: 2425 [2018-09-23 19:32:55,656 INFO L226 Difference]: Without dead ends: 2419 [2018-09-23 19:32:55,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2018-09-23 19:32:55,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2018-09-23 19:32:56,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1373. [2018-09-23 19:32:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2018-09-23 19:32:56,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 4822 transitions. [2018-09-23 19:32:56,595 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 4822 transitions. Word has length 8 [2018-09-23 19:32:56,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:56,595 INFO L480 AbstractCegarLoop]: Abstraction has 1373 states and 4822 transitions. [2018-09-23 19:32:56,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:56,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 4822 transitions. [2018-09-23 19:32:56,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:32:56,596 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:56,596 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:56,597 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:56,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:56,597 INFO L82 PathProgramCache]: Analyzing trace with hash -881085998, now seen corresponding path program 1 times [2018-09-23 19:32:56,597 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:56,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:56,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:56,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:56,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:56,686 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:56,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:32:56,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:56,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:56,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:56,687 INFO L87 Difference]: Start difference. First operand 1373 states and 4822 transitions. Second operand 8 states. [2018-09-23 19:33:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:01,320 INFO L93 Difference]: Finished difference Result 2278 states and 6952 transitions. [2018-09-23 19:33:01,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 19:33:01,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:33:01,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:01,326 INFO L225 Difference]: With dead ends: 2278 [2018-09-23 19:33:01,326 INFO L226 Difference]: Without dead ends: 2272 [2018-09-23 19:33:01,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-09-23 19:33:01,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2018-09-23 19:33:02,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1421. [2018-09-23 19:33:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2018-09-23 19:33:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 4963 transitions. [2018-09-23 19:33:02,322 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 4963 transitions. Word has length 8 [2018-09-23 19:33:02,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:02,322 INFO L480 AbstractCegarLoop]: Abstraction has 1421 states and 4963 transitions. [2018-09-23 19:33:02,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:33:02,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 4963 transitions. [2018-09-23 19:33:02,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:33:02,323 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:02,323 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:02,323 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:02,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:02,323 INFO L82 PathProgramCache]: Analyzing trace with hash -881086125, now seen corresponding path program 1 times [2018-09-23 19:33:02,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:02,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:02,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:02,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:02,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:02,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:02,510 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:33:02,510 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:33:02,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:33:02,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:33:02,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:33:02,511 INFO L87 Difference]: Start difference. First operand 1421 states and 4963 transitions. Second operand 8 states. [2018-09-23 19:33:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:06,808 INFO L93 Difference]: Finished difference Result 2233 states and 6848 transitions. [2018-09-23 19:33:06,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 19:33:06,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:33:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:06,814 INFO L225 Difference]: With dead ends: 2233 [2018-09-23 19:33:06,814 INFO L226 Difference]: Without dead ends: 2227 [2018-09-23 19:33:06,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-09-23 19:33:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2018-09-23 19:33:07,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1411. [2018-09-23 19:33:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-09-23 19:33:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 4926 transitions. [2018-09-23 19:33:07,753 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 4926 transitions. Word has length 8 [2018-09-23 19:33:07,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:07,753 INFO L480 AbstractCegarLoop]: Abstraction has 1411 states and 4926 transitions. [2018-09-23 19:33:07,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:33:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 4926 transitions. [2018-09-23 19:33:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:33:07,754 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:07,754 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:07,754 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:07,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:07,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099334, now seen corresponding path program 1 times [2018-09-23 19:33:07,754 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:07,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:07,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:07,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:07,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:07,979 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2018-09-23 19:33:08,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:08,059 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:33:08,059 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:33:08,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:33:08,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:33:08,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:33:08,060 INFO L87 Difference]: Start difference. First operand 1411 states and 4926 transitions. Second operand 8 states. [2018-09-23 19:33:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:12,714 INFO L93 Difference]: Finished difference Result 2558 states and 7836 transitions. [2018-09-23 19:33:12,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 19:33:12,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:33:12,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:12,719 INFO L225 Difference]: With dead ends: 2558 [2018-09-23 19:33:12,719 INFO L226 Difference]: Without dead ends: 2552 [2018-09-23 19:33:12,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-09-23 19:33:12,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-09-23 19:33:13,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1471. [2018-09-23 19:33:13,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2018-09-23 19:33:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 5183 transitions. [2018-09-23 19:33:13,681 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 5183 transitions. Word has length 8 [2018-09-23 19:33:13,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:13,681 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 5183 transitions. [2018-09-23 19:33:13,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:33:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 5183 transitions. [2018-09-23 19:33:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:33:13,683 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:13,683 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:13,683 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:13,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:13,683 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099337, now seen corresponding path program 1 times [2018-09-23 19:33:13,684 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:13,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:13,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:13,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:13,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:13,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:13,805 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:33:13,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:33:13,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:33:13,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:33:13,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:33:13,805 INFO L87 Difference]: Start difference. First operand 1471 states and 5183 transitions. Second operand 8 states. [2018-09-23 19:33:13,940 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-09-23 19:33:18,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:18,659 INFO L93 Difference]: Finished difference Result 2703 states and 8278 transitions. [2018-09-23 19:33:18,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:33:18,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:33:18,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:18,665 INFO L225 Difference]: With dead ends: 2703 [2018-09-23 19:33:18,665 INFO L226 Difference]: Without dead ends: 2697 [2018-09-23 19:33:18,666 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-09-23 19:33:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2018-09-23 19:33:19,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1480. [2018-09-23 19:33:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-09-23 19:33:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5200 transitions. [2018-09-23 19:33:19,753 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5200 transitions. Word has length 8 [2018-09-23 19:33:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:19,753 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5200 transitions. [2018-09-23 19:33:19,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:33:19,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5200 transitions. [2018-09-23 19:33:19,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:33:19,754 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:19,754 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:19,754 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:19,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:19,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629971, now seen corresponding path program 1 times [2018-09-23 19:33:19,755 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:19,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:19,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:19,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:19,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:20,243 WARN L178 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2018-09-23 19:33:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:20,302 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:33:20,302 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:33:20,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:33:20,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:33:20,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:33:20,303 INFO L87 Difference]: Start difference. First operand 1480 states and 5200 transitions. Second operand 8 states. [2018-09-23 19:33:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:25,454 INFO L93 Difference]: Finished difference Result 2674 states and 8171 transitions. [2018-09-23 19:33:25,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:33:25,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:33:25,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:25,464 INFO L225 Difference]: With dead ends: 2674 [2018-09-23 19:33:25,464 INFO L226 Difference]: Without dead ends: 2668 [2018-09-23 19:33:25,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:33:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2018-09-23 19:33:26,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 1480. [2018-09-23 19:33:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-09-23 19:33:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5196 transitions. [2018-09-23 19:33:26,532 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5196 transitions. Word has length 8 [2018-09-23 19:33:26,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:26,532 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5196 transitions. [2018-09-23 19:33:26,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:33:26,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5196 transitions. [2018-09-23 19:33:26,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:33:26,533 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:26,533 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:26,533 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:26,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:26,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629974, now seen corresponding path program 1 times [2018-09-23 19:33:26,534 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:26,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:26,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:26,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:26,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:26,766 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:33:26,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:33:26,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:33:26,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:33:26,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:33:26,767 INFO L87 Difference]: Start difference. First operand 1480 states and 5196 transitions. Second operand 8 states. [2018-09-23 19:33:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:32,297 INFO L93 Difference]: Finished difference Result 2722 states and 8299 transitions. [2018-09-23 19:33:32,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-23 19:33:32,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-23 19:33:32,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:32,303 INFO L225 Difference]: With dead ends: 2722 [2018-09-23 19:33:32,303 INFO L226 Difference]: Without dead ends: 2716 [2018-09-23 19:33:32,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-09-23 19:33:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2018-09-23 19:33:33,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 1462. [2018-09-23 19:33:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2018-09-23 19:33:33,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 5124 transitions. [2018-09-23 19:33:33,417 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 5124 transitions. Word has length 8 [2018-09-23 19:33:33,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:33,418 INFO L480 AbstractCegarLoop]: Abstraction has 1462 states and 5124 transitions. [2018-09-23 19:33:33,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:33:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 5124 transitions. [2018-09-23 19:33:33,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:33:33,419 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:33,419 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:33,419 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:33,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:33,419 INFO L82 PathProgramCache]: Analyzing trace with hash 278041308, now seen corresponding path program 1 times [2018-09-23 19:33:33,419 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:33,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:33,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:33,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:33,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:33,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:33,671 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:33:33,671 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:33:33,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:33:33,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:33:33,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:33:33,672 INFO L87 Difference]: Start difference. First operand 1462 states and 5124 transitions. Second operand 8 states. [2018-09-23 19:33:38,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:38,712 INFO L93 Difference]: Finished difference Result 2962 states and 9218 transitions. [2018-09-23 19:33:38,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 19:33:38,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-23 19:33:38,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:38,719 INFO L225 Difference]: With dead ends: 2962 [2018-09-23 19:33:38,719 INFO L226 Difference]: Without dead ends: 2956 [2018-09-23 19:33:38,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-23 19:33:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2018-09-23 19:33:40,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1776. [2018-09-23 19:33:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-09-23 19:33:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 6236 transitions. [2018-09-23 19:33:40,183 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 6236 transitions. Word has length 9 [2018-09-23 19:33:40,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:40,184 INFO L480 AbstractCegarLoop]: Abstraction has 1776 states and 6236 transitions. [2018-09-23 19:33:40,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:33:40,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 6236 transitions. [2018-09-23 19:33:40,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:33:40,185 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:40,185 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:40,185 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:40,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:40,185 INFO L82 PathProgramCache]: Analyzing trace with hash 278041683, now seen corresponding path program 1 times [2018-09-23 19:33:40,185 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:40,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:40,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:40,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:40,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:40,259 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:33:40,259 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:33:40,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:33:40,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:33:40,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:33:40,260 INFO L87 Difference]: Start difference. First operand 1776 states and 6236 transitions. Second operand 8 states. [2018-09-23 19:33:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:45,397 INFO L93 Difference]: Finished difference Result 2948 states and 9162 transitions. [2018-09-23 19:33:45,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 19:33:45,398 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-23 19:33:45,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:45,403 INFO L225 Difference]: With dead ends: 2948 [2018-09-23 19:33:45,403 INFO L226 Difference]: Without dead ends: 2942 [2018-09-23 19:33:45,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-23 19:33:45,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2018-09-23 19:33:46,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1772. [2018-09-23 19:33:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-09-23 19:33:46,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 6220 transitions. [2018-09-23 19:33:46,899 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 6220 transitions. Word has length 9 [2018-09-23 19:33:46,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:46,899 INFO L480 AbstractCegarLoop]: Abstraction has 1772 states and 6220 transitions. [2018-09-23 19:33:46,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:33:46,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 6220 transitions. [2018-09-23 19:33:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:33:46,901 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:46,901 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:46,901 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:46,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:46,901 INFO L82 PathProgramCache]: Analyzing trace with hash 541105076, now seen corresponding path program 1 times [2018-09-23 19:33:46,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:46,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:46,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:46,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:46,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:46,974 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:33:46,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:33:46,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:33:46,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:33:46,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:33:46,976 INFO L87 Difference]: Start difference. First operand 1772 states and 6220 transitions. Second operand 8 states. [2018-09-23 19:33:53,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:53,125 INFO L93 Difference]: Finished difference Result 3238 states and 9970 transitions. [2018-09-23 19:33:53,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:33:53,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-23 19:33:53,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:53,132 INFO L225 Difference]: With dead ends: 3238 [2018-09-23 19:33:53,132 INFO L226 Difference]: Without dead ends: 3232 [2018-09-23 19:33:53,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-09-23 19:33:53,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2018-09-23 19:33:54,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1799. [2018-09-23 19:33:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-09-23 19:33:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 6288 transitions. [2018-09-23 19:33:54,649 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 6288 transitions. Word has length 9 [2018-09-23 19:33:54,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:54,649 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 6288 transitions. [2018-09-23 19:33:54,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:33:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 6288 transitions. [2018-09-23 19:33:54,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:33:54,651 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:54,651 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:54,651 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:54,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:54,651 INFO L82 PathProgramCache]: Analyzing trace with hash 541105451, now seen corresponding path program 1 times [2018-09-23 19:33:54,651 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:54,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:54,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:54,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:54,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:54,976 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:33:54,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:33:54,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:33:54,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:33:54,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:33:54,977 INFO L87 Difference]: Start difference. First operand 1799 states and 6288 transitions. Second operand 8 states. [2018-09-23 19:34:01,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:01,263 INFO L93 Difference]: Finished difference Result 3212 states and 9854 transitions. [2018-09-23 19:34:01,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:34:01,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-23 19:34:01,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:01,270 INFO L225 Difference]: With dead ends: 3212 [2018-09-23 19:34:01,270 INFO L226 Difference]: Without dead ends: 3206 [2018-09-23 19:34:01,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-09-23 19:34:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2018-09-23 19:34:02,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 1737. [2018-09-23 19:34:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2018-09-23 19:34:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 6062 transitions. [2018-09-23 19:34:02,844 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 6062 transitions. Word has length 9 [2018-09-23 19:34:02,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:02,844 INFO L480 AbstractCegarLoop]: Abstraction has 1737 states and 6062 transitions. [2018-09-23 19:34:02,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:34:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 6062 transitions. [2018-09-23 19:34:02,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:34:02,846 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:02,846 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:34:02,846 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:02,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:02,846 INFO L82 PathProgramCache]: Analyzing trace with hash 825189368, now seen corresponding path program 1 times [2018-09-23 19:34:02,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:02,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:02,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:02,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:02,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:02,928 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:34:02,928 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:34:02,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:34:02,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:34:02,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:34:02,929 INFO L87 Difference]: Start difference. First operand 1737 states and 6062 transitions. Second operand 8 states. [2018-09-23 19:34:08,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:08,758 INFO L93 Difference]: Finished difference Result 3315 states and 10043 transitions. [2018-09-23 19:34:08,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 19:34:08,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-23 19:34:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:08,765 INFO L225 Difference]: With dead ends: 3315 [2018-09-23 19:34:08,765 INFO L226 Difference]: Without dead ends: 3309 [2018-09-23 19:34:08,766 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-09-23 19:34:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2018-09-23 19:34:10,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 1985. [2018-09-23 19:34:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2018-09-23 19:34:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 6886 transitions. [2018-09-23 19:34:10,493 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 6886 transitions. Word has length 9 [2018-09-23 19:34:10,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:10,493 INFO L480 AbstractCegarLoop]: Abstraction has 1985 states and 6886 transitions. [2018-09-23 19:34:10,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:34:10,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 6886 transitions. [2018-09-23 19:34:10,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:34:10,494 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:10,494 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:34:10,495 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:10,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:10,495 INFO L82 PathProgramCache]: Analyzing trace with hash 825189371, now seen corresponding path program 1 times [2018-09-23 19:34:10,495 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:10,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:10,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:10,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:10,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:10,598 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:34:10,598 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:34:10,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:34:10,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:34:10,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:34:10,599 INFO L87 Difference]: Start difference. First operand 1985 states and 6886 transitions. Second operand 8 states. [2018-09-23 19:34:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:17,206 INFO L93 Difference]: Finished difference Result 3446 states and 10415 transitions. [2018-09-23 19:34:17,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:34:17,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-23 19:34:17,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:17,214 INFO L225 Difference]: With dead ends: 3446 [2018-09-23 19:34:17,214 INFO L226 Difference]: Without dead ends: 3440 [2018-09-23 19:34:17,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:34:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2018-09-23 19:34:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 1927. [2018-09-23 19:34:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1927 states. [2018-09-23 19:34:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 6663 transitions. [2018-09-23 19:34:19,074 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 6663 transitions. Word has length 9 [2018-09-23 19:34:19,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:19,074 INFO L480 AbstractCegarLoop]: Abstraction has 1927 states and 6663 transitions. [2018-09-23 19:34:19,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:34:19,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 6663 transitions. [2018-09-23 19:34:19,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:34:19,075 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:19,075 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:34:19,076 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:19,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:19,076 INFO L82 PathProgramCache]: Analyzing trace with hash 832700792, now seen corresponding path program 1 times [2018-09-23 19:34:19,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:19,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:19,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:19,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:19,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:19,257 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:34:19,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:34:19,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:34:19,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:34:19,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:34:19,258 INFO L87 Difference]: Start difference. First operand 1927 states and 6663 transitions. Second operand 8 states. [2018-09-23 19:34:24,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:24,905 INFO L93 Difference]: Finished difference Result 2832 states and 8631 transitions. [2018-09-23 19:34:24,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 19:34:24,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-23 19:34:24,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:24,911 INFO L225 Difference]: With dead ends: 2832 [2018-09-23 19:34:24,911 INFO L226 Difference]: Without dead ends: 2824 [2018-09-23 19:34:24,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-23 19:34:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2018-09-23 19:34:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 1904. [2018-09-23 19:34:26,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-09-23 19:34:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 6553 transitions. [2018-09-23 19:34:26,781 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 6553 transitions. Word has length 9 [2018-09-23 19:34:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:26,782 INFO L480 AbstractCegarLoop]: Abstraction has 1904 states and 6553 transitions. [2018-09-23 19:34:26,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:34:26,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 6553 transitions. [2018-09-23 19:34:26,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:34:26,783 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:26,783 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:34:26,783 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:26,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:26,784 INFO L82 PathProgramCache]: Analyzing trace with hash -595843680, now seen corresponding path program 1 times [2018-09-23 19:34:26,784 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:26,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:26,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:26,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:26,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:26,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:26,902 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:34:26,902 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:34:26,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:34:26,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:34:26,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:34:26,903 INFO L87 Difference]: Start difference. First operand 1904 states and 6553 transitions. Second operand 9 states. [2018-09-23 19:34:32,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:32,950 INFO L93 Difference]: Finished difference Result 3157 states and 9716 transitions. [2018-09-23 19:34:32,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:34:32,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-23 19:34:32,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:32,957 INFO L225 Difference]: With dead ends: 3157 [2018-09-23 19:34:32,957 INFO L226 Difference]: Without dead ends: 3151 [2018-09-23 19:34:32,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-09-23 19:34:32,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2018-09-23 19:34:34,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 1949. [2018-09-23 19:34:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2018-09-23 19:34:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 6722 transitions. [2018-09-23 19:34:34,790 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 6722 transitions. Word has length 9 [2018-09-23 19:34:34,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:34,790 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 6722 transitions. [2018-09-23 19:34:34,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:34:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 6722 transitions. [2018-09-23 19:34:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:34:34,791 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:34,791 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:34:34,792 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:34,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:34,792 INFO L82 PathProgramCache]: Analyzing trace with hash -595843677, now seen corresponding path program 1 times [2018-09-23 19:34:34,792 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:34,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:34,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:34,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:34,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:34,922 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:34:34,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:34:34,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:34:34,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:34:34,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:34:34,923 INFO L87 Difference]: Start difference. First operand 1949 states and 6722 transitions. Second operand 9 states. [2018-09-23 19:34:43,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:43,472 INFO L93 Difference]: Finished difference Result 3822 states and 11523 transitions. [2018-09-23 19:34:43,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-23 19:34:43,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-23 19:34:43,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:43,480 INFO L225 Difference]: With dead ends: 3822 [2018-09-23 19:34:43,480 INFO L226 Difference]: Without dead ends: 3816 [2018-09-23 19:34:43,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2018-09-23 19:34:43,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2018-09-23 19:34:45,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 2098. [2018-09-23 19:34:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-09-23 19:34:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 7405 transitions. [2018-09-23 19:34:45,630 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 7405 transitions. Word has length 9 [2018-09-23 19:34:45,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:45,630 INFO L480 AbstractCegarLoop]: Abstraction has 2098 states and 7405 transitions. [2018-09-23 19:34:45,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:34:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 7405 transitions. [2018-09-23 19:34:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:34:45,632 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:45,632 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:34:45,632 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:45,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:45,633 INFO L82 PathProgramCache]: Analyzing trace with hash -204435682, now seen corresponding path program 1 times [2018-09-23 19:34:45,633 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:45,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:45,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:45,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:45,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:45,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:45,764 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:34:45,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:34:45,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:34:45,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:34:45,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:34:45,764 INFO L87 Difference]: Start difference. First operand 2098 states and 7405 transitions. Second operand 9 states. [2018-09-23 19:34:54,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:54,963 INFO L93 Difference]: Finished difference Result 4144 states and 12499 transitions. [2018-09-23 19:34:54,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-23 19:34:54,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-23 19:34:54,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:54,973 INFO L225 Difference]: With dead ends: 4144 [2018-09-23 19:34:54,973 INFO L226 Difference]: Without dead ends: 4138 [2018-09-23 19:34:54,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2018-09-23 19:34:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2018-09-23 19:34:57,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 2260. [2018-09-23 19:34:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2018-09-23 19:34:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 7995 transitions. [2018-09-23 19:34:57,526 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 7995 transitions. Word has length 9 [2018-09-23 19:34:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:57,526 INFO L480 AbstractCegarLoop]: Abstraction has 2260 states and 7995 transitions. [2018-09-23 19:34:57,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:34:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 7995 transitions. [2018-09-23 19:34:57,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:34:57,528 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:57,528 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:34:57,528 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:57,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:57,528 INFO L82 PathProgramCache]: Analyzing trace with hash -204435307, now seen corresponding path program 1 times [2018-09-23 19:34:57,529 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:57,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:57,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:57,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:57,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:57,705 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:34:57,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:34:57,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:34:57,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:34:57,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:34:57,706 INFO L87 Difference]: Start difference. First operand 2260 states and 7995 transitions. Second operand 9 states. [2018-09-23 19:35:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:35:04,903 INFO L93 Difference]: Finished difference Result 3320 states and 10163 transitions. [2018-09-23 19:35:04,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 19:35:04,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-23 19:35:04,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:35:04,911 INFO L225 Difference]: With dead ends: 3320 [2018-09-23 19:35:04,911 INFO L226 Difference]: Without dead ends: 3314 [2018-09-23 19:35:04,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-09-23 19:35:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2018-09-23 19:35:07,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 2191. [2018-09-23 19:35:07,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2191 states. [2018-09-23 19:35:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 7721 transitions. [2018-09-23 19:35:07,466 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 7721 transitions. Word has length 9 [2018-09-23 19:35:07,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:35:07,466 INFO L480 AbstractCegarLoop]: Abstraction has 2191 states and 7721 transitions. [2018-09-23 19:35:07,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:35:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 7721 transitions. [2018-09-23 19:35:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:35:07,468 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:35:07,468 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:35:07,468 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:35:07,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:35:07,468 INFO L82 PathProgramCache]: Analyzing trace with hash -966522519, now seen corresponding path program 1 times [2018-09-23 19:35:07,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:35:07,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:35:07,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:35:07,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:35:07,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:35:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:35:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:35:07,583 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:35:07,583 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:35:07,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:35:07,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:35:07,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:35:07,584 INFO L87 Difference]: Start difference. First operand 2191 states and 7721 transitions. Second operand 8 states. [2018-09-23 19:35:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:35:17,268 INFO L93 Difference]: Finished difference Result 4113 states and 13014 transitions. [2018-09-23 19:35:17,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 19:35:17,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-23 19:35:17,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:35:17,277 INFO L225 Difference]: With dead ends: 4113 [2018-09-23 19:35:17,277 INFO L226 Difference]: Without dead ends: 4107 [2018-09-23 19:35:17,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-09-23 19:35:17,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2018-09-23 19:35:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 2224. [2018-09-23 19:35:19,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2018-09-23 19:35:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 7857 transitions. [2018-09-23 19:35:19,838 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 7857 transitions. Word has length 9 [2018-09-23 19:35:19,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:35:19,838 INFO L480 AbstractCegarLoop]: Abstraction has 2224 states and 7857 transitions. [2018-09-23 19:35:19,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:35:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 7857 transitions. [2018-09-23 19:35:19,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:35:19,840 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:35:19,840 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:35:19,840 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr7ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:35:19,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:35:19,840 INFO L82 PathProgramCache]: Analyzing trace with hash -966522144, now seen corresponding path program 1 times [2018-09-23 19:35:19,841 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:35:19,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:35:19,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:35:19,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:35:19,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:35:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:35:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:35:19,939 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:35:19,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-23 19:35:19,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:35:19,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:35:19,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:35:19,940 INFO L87 Difference]: Start difference. First operand 2224 states and 7857 transitions. Second operand 8 states. Received shutdown request... [2018-09-23 19:35:26,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:35:26,482 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-23 19:35:26,488 WARN L206 ceAbstractionStarter]: Timeout [2018-09-23 19:35:26,488 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 07:35:26 BoogieIcfgContainer [2018-09-23 19:35:26,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 19:35:26,489 INFO L168 Benchmark]: Toolchain (without parser) took 262931.90 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -173.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-09-23 19:35:26,490 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-09-23 19:35:26,490 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.06 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-09-23 19:35:26,491 INFO L168 Benchmark]: Boogie Preprocessor took 71.58 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-09-23 19:35:26,491 INFO L168 Benchmark]: RCFGBuilder took 1204.50 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-09-23 19:35:26,492 INFO L168 Benchmark]: TraceAbstraction took 261590.49 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -215.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-09-23 19:35:26,494 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.19 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 57.06 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 71.58 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 1204.50 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 261590.49 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -215.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 (2201 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 (2201 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 (2201 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 (2201 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 (2201 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 (2201 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 (2201 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 (2201 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 (2201 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 (2201 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 (2201 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 (2201 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 (2201 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 (2201 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 (2201 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 263]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 263). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (2201 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 (2201 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 (2201 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 (2201 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 (2201 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 (2201 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 (2201 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 (2201 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 (2201 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 (2201 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 (2201 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 (2201 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 27 error locations. TIMEOUT Result, 261.5s OverallTime, 53 OverallIterations, 2 TraceHistogramMax, 211.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14967 SDtfs, 26581 SDslu, 28629 SDs, 0 SdLazy, 102546 SolverSat, 9511 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 101.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 821 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 817 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2149 ImplicationChecksByTransitivity, 17.8s 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: 40.8s AutomataMinimizationTime, 52 MinimizatonAttempts, 43801 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.7s 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-09-23_19-35-26-507.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_19-35-26-507.csv Completed graceful shutdown