java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:40:23,017 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:40:23,019 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:40:23,032 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:40:23,032 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:40:23,034 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:40:23,036 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:40:23,038 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:40:23,041 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:40:23,047 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:40:23,048 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:40:23,052 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:40:23,053 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:40:23,057 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:40:23,058 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:40:23,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:40:23,063 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:40:23,066 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:40:23,068 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:40:23,073 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:40:23,077 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:40:23,079 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:40:23,083 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:40:23,083 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:40:23,083 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:40:23,084 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:40:23,085 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:40:23,086 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:40:23,087 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:40:23,091 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:40:23,092 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:40:23,092 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:40:23,093 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:40:23,093 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:40:23,096 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:40:23,097 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:40:23,097 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-26 21:40:23,125 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:40:23,125 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:40:23,126 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:40:23,130 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:40:23,131 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:40:23,131 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:40:23,131 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:40:23,131 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:40:23,131 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:40:23,132 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:40:23,132 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:40:23,132 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:40:23,132 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:40:23,133 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:40:23,134 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:40:23,134 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:40:23,134 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:40:23,134 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:40:23,135 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:40:23,135 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:40:23,135 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:40:23,135 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:40:23,136 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:40:23,137 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:40:23,137 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:40:23,137 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:40:23,137 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:40:23,137 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:40:23,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:40:23,138 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:40:23,138 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:40:23,205 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:40:23,220 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:40:23,225 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:40:23,227 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:40:23,228 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:40:23,228 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-26 21:40:23,229 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-09-26 21:40:23,334 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:40:23,338 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:40:23,338 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:40:23,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:40:23,339 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:40:23,360 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 26.09 09:40:23" (1/1) ... [2018-09-26 21:40:23,376 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 26.09 09:40:23" (1/1) ... [2018-09-26 21:40:23,381 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 21:40:23,381 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 21:40:23,382 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 21:40:23,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:40:23,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:40:23,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:40:23,387 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:40:23,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (1/1) ... [2018-09-26 21:40:23,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (1/1) ... [2018-09-26 21:40:23,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (1/1) ... [2018-09-26 21:40:23,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (1/1) ... [2018-09-26 21:40:23,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (1/1) ... [2018-09-26 21:40:23,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (1/1) ... [2018-09-26 21:40:23,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (1/1) ... [2018-09-26 21:40:23,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:40:23,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:40:23,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:40:23,459 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:40:23,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (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-26 21:40:23,534 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-26 21:40:23,535 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-26 21:40:23,535 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-26 21:40:24,564 INFO L343 CfgBuilder]: Using library mode [2018-09-26 21:40:24,564 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:40:24 BoogieIcfgContainer [2018-09-26 21:40:24,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:40:24,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:40:24,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:40:24,569 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:40:24,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (1/2) ... [2018-09-26 21:40:24,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70fe08a0 and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:40:24, skipping insertion in model container [2018-09-26 21:40:24,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:40:24" (2/2) ... [2018-09-26 21:40:24,573 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-09-26 21:40:24,582 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:40:24,592 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-09-26 21:40:24,649 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:40:24,650 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:40:24,650 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:40:24,650 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:40:24,650 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:40:24,651 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:40:24,651 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:40:24,651 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:40:24,651 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:40:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-09-26 21:40:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 21:40:24,678 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:24,679 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 21:40:24,682 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:24,690 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:24,690 INFO L82 PathProgramCache]: Analyzing trace with hash 45506320, now seen corresponding path program 1 times [2018-09-26 21:40:24,692 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:24,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:24,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:24,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:24,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:24,920 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-26 21:40:24,922 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:24,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:40:24,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:40:24,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:40:24,941 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:24,942 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 5 states. [2018-09-26 21:40:28,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:28,467 INFO L93 Difference]: Finished difference Result 142 states and 303 transitions. [2018-09-26 21:40:28,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:40:28,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 21:40:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:28,488 INFO L225 Difference]: With dead ends: 142 [2018-09-26 21:40:28,488 INFO L226 Difference]: Without dead ends: 138 [2018-09-26 21:40:28,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-26 21:40:28,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2018-09-26 21:40:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 21:40:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 219 transitions. [2018-09-26 21:40:28,554 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 219 transitions. Word has length 5 [2018-09-26 21:40:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:28,556 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 219 transitions. [2018-09-26 21:40:28,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:40:28,556 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 219 transitions. [2018-09-26 21:40:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 21:40:28,557 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:28,557 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 21:40:28,559 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:28,559 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:28,560 INFO L82 PathProgramCache]: Analyzing trace with hash 45756290, now seen corresponding path program 1 times [2018-09-26 21:40:28,560 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:28,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:28,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:28,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:28,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:28,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-26 21:40:28,705 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:28,706 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:40:28,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:40:28,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:40:28,708 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:28,709 INFO L87 Difference]: Start difference. First operand 98 states and 219 transitions. Second operand 5 states. [2018-09-26 21:40:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:32,714 INFO L93 Difference]: Finished difference Result 241 states and 539 transitions. [2018-09-26 21:40:32,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:40:32,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 21:40:32,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:32,720 INFO L225 Difference]: With dead ends: 241 [2018-09-26 21:40:32,720 INFO L226 Difference]: Without dead ends: 237 [2018-09-26 21:40:32,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-26 21:40:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 134. [2018-09-26 21:40:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-26 21:40:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2018-09-26 21:40:32,756 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 5 [2018-09-26 21:40:32,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:32,757 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2018-09-26 21:40:32,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:40:32,757 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2018-09-26 21:40:32,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 21:40:32,758 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:32,758 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 21:40:32,759 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:32,759 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:32,760 INFO L82 PathProgramCache]: Analyzing trace with hash 28948051, now seen corresponding path program 1 times [2018-09-26 21:40:32,760 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:32,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:32,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:32,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:32,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:32,856 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:32,856 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:40:32,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:40:32,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:40:32,858 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:32,858 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 5 states. [2018-09-26 21:40:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:36,785 INFO L93 Difference]: Finished difference Result 269 states and 639 transitions. [2018-09-26 21:40:36,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:40:36,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 21:40:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:36,790 INFO L225 Difference]: With dead ends: 269 [2018-09-26 21:40:36,790 INFO L226 Difference]: Without dead ends: 265 [2018-09-26 21:40:36,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:36,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-26 21:40:36,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 162. [2018-09-26 21:40:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-26 21:40:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 455 transitions. [2018-09-26 21:40:36,827 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 455 transitions. Word has length 5 [2018-09-26 21:40:36,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:36,828 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 455 transitions. [2018-09-26 21:40:36,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:40:36,828 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 455 transitions. [2018-09-26 21:40:36,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:40:36,829 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:36,830 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:36,831 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:36,831 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:36,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558066, now seen corresponding path program 1 times [2018-09-26 21:40:36,831 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:36,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:36,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:36,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:36,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:36,942 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-26 21:40:36,942 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:36,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:40:36,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:40:36,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:40:36,944 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:36,944 INFO L87 Difference]: Start difference. First operand 162 states and 455 transitions. Second operand 8 states. [2018-09-26 21:40:46,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:46,853 INFO L93 Difference]: Finished difference Result 790 states and 2085 transitions. [2018-09-26 21:40:46,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 21:40:46,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 21:40:46,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:46,860 INFO L225 Difference]: With dead ends: 790 [2018-09-26 21:40:46,860 INFO L226 Difference]: Without dead ends: 629 [2018-09-26 21:40:46,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:46,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-09-26 21:40:46,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 278. [2018-09-26 21:40:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-09-26 21:40:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 854 transitions. [2018-09-26 21:40:46,921 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 854 transitions. Word has length 8 [2018-09-26 21:40:46,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:46,921 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 854 transitions. [2018-09-26 21:40:46,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:40:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 854 transitions. [2018-09-26 21:40:46,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:40:46,923 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:46,923 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:46,924 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:46,924 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:46,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558063, now seen corresponding path program 1 times [2018-09-26 21:40:46,925 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:46,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:46,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:46,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:46,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:47,073 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-26 21:40:47,074 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:47,074 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:40:47,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:40:47,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:40:47,075 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:47,075 INFO L87 Difference]: Start difference. First operand 278 states and 854 transitions. Second operand 8 states. [2018-09-26 21:40:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:57,457 INFO L93 Difference]: Finished difference Result 634 states and 1540 transitions. [2018-09-26 21:40:57,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:40:57,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 21:40:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:57,462 INFO L225 Difference]: With dead ends: 634 [2018-09-26 21:40:57,462 INFO L226 Difference]: Without dead ends: 628 [2018-09-26 21:40:57,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:57,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-09-26 21:40:57,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 310. [2018-09-26 21:40:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-09-26 21:40:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 963 transitions. [2018-09-26 21:40:57,520 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 963 transitions. Word has length 8 [2018-09-26 21:40:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:57,520 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 963 transitions. [2018-09-26 21:40:57,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:40:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 963 transitions. [2018-09-26 21:40:57,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:40:57,523 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:57,523 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:57,524 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:57,524 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:57,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1080099218, now seen corresponding path program 1 times [2018-09-26 21:40:57,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:57,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:57,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:57,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:57,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:57,655 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-26 21:40:57,655 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:57,656 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:40:57,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:40:57,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:40:57,657 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:57,657 INFO L87 Difference]: Start difference. First operand 310 states and 963 transitions. Second operand 8 states. [2018-09-26 21:41:07,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:07,340 INFO L93 Difference]: Finished difference Result 768 states and 2087 transitions. [2018-09-26 21:41:07,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:41:07,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 21:41:07,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:07,346 INFO L225 Difference]: With dead ends: 768 [2018-09-26 21:41:07,346 INFO L226 Difference]: Without dead ends: 537 [2018-09-26 21:41:07,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:07,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-09-26 21:41:07,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 334. [2018-09-26 21:41:07,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-09-26 21:41:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1037 transitions. [2018-09-26 21:41:07,414 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1037 transitions. Word has length 8 [2018-09-26 21:41:07,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:07,414 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1037 transitions. [2018-09-26 21:41:07,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1037 transitions. [2018-09-26 21:41:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:41:07,416 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:07,416 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:07,417 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:07,417 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:07,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595081, now seen corresponding path program 1 times [2018-09-26 21:41:07,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:07,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:07,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:07,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:07,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:07,543 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-26 21:41:07,543 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:07,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:41:07,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:41:07,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:41:07,544 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:07,544 INFO L87 Difference]: Start difference. First operand 334 states and 1037 transitions. Second operand 8 states. [2018-09-26 21:41:18,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:18,139 INFO L93 Difference]: Finished difference Result 1145 states and 3146 transitions. [2018-09-26 21:41:18,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:41:18,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 21:41:18,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:18,150 INFO L225 Difference]: With dead ends: 1145 [2018-09-26 21:41:18,151 INFO L226 Difference]: Without dead ends: 812 [2018-09-26 21:41:18,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:18,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-09-26 21:41:18,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 450. [2018-09-26 21:41:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-09-26 21:41:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1432 transitions. [2018-09-26 21:41:18,239 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1432 transitions. Word has length 8 [2018-09-26 21:41:18,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:18,240 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1432 transitions. [2018-09-26 21:41:18,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1432 transitions. [2018-09-26 21:41:18,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:41:18,241 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:18,241 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:18,242 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:18,242 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:18,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595078, now seen corresponding path program 1 times [2018-09-26 21:41:18,243 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:18,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:18,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:18,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:18,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:18,392 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-26 21:41:18,393 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:18,393 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:41:18,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:41:18,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:41:18,394 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:18,394 INFO L87 Difference]: Start difference. First operand 450 states and 1432 transitions. Second operand 8 states. [2018-09-26 21:41:26,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:26,564 INFO L93 Difference]: Finished difference Result 877 states and 2260 transitions. [2018-09-26 21:41:26,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 21:41:26,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 21:41:26,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:26,570 INFO L225 Difference]: With dead ends: 877 [2018-09-26 21:41:26,570 INFO L226 Difference]: Without dead ends: 871 [2018-09-26 21:41:26,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:26,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-09-26 21:41:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 478. [2018-09-26 21:41:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-09-26 21:41:26,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1531 transitions. [2018-09-26 21:41:26,676 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1531 transitions. Word has length 8 [2018-09-26 21:41:26,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:26,676 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 1531 transitions. [2018-09-26 21:41:26,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:26,676 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1531 transitions. [2018-09-26 21:41:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:41:26,677 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:26,678 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:26,678 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:26,679 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:26,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064444, now seen corresponding path program 1 times [2018-09-26 21:41:26,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:26,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:26,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:26,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:26,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:26,853 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-26 21:41:26,853 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:26,853 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:41:26,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:41:26,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:41:26,854 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:26,854 INFO L87 Difference]: Start difference. First operand 478 states and 1531 transitions. Second operand 8 states. [2018-09-26 21:41:35,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:35,807 INFO L93 Difference]: Finished difference Result 1049 states and 2854 transitions. [2018-09-26 21:41:35,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:41:35,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 21:41:35,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:35,812 INFO L225 Difference]: With dead ends: 1049 [2018-09-26 21:41:35,812 INFO L226 Difference]: Without dead ends: 818 [2018-09-26 21:41:35,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:35,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-09-26 21:41:35,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 524. [2018-09-26 21:41:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-09-26 21:41:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1684 transitions. [2018-09-26 21:41:35,943 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1684 transitions. Word has length 8 [2018-09-26 21:41:35,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:35,943 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 1684 transitions. [2018-09-26 21:41:35,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1684 transitions. [2018-09-26 21:41:35,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:41:35,945 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:35,945 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:35,946 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:35,946 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:35,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064441, now seen corresponding path program 1 times [2018-09-26 21:41:35,946 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:35,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:35,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:35,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:35,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:36,045 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-26 21:41:36,046 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:36,046 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:41:36,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:41:36,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:41:36,046 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:36,047 INFO L87 Difference]: Start difference. First operand 524 states and 1684 transitions. Second operand 8 states. [2018-09-26 21:41:43,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:43,429 INFO L93 Difference]: Finished difference Result 733 states and 1997 transitions. [2018-09-26 21:41:43,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:41:43,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 21:41:43,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:43,435 INFO L225 Difference]: With dead ends: 733 [2018-09-26 21:41:43,435 INFO L226 Difference]: Without dead ends: 727 [2018-09-26 21:41:43,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-09-26 21:41:43,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 530. [2018-09-26 21:41:43,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-09-26 21:41:43,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1690 transitions. [2018-09-26 21:41:43,597 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1690 transitions. Word has length 8 [2018-09-26 21:41:43,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:43,597 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1690 transitions. [2018-09-26 21:41:43,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:43,597 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1690 transitions. [2018-09-26 21:41:43,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:41:43,598 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:43,598 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:43,599 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:43,599 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:43,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656691, now seen corresponding path program 1 times [2018-09-26 21:41:43,600 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:43,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:43,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:43,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:43,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:44,011 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-26 21:41:44,011 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:44,012 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:41:44,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:41:44,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:41:44,012 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:44,012 INFO L87 Difference]: Start difference. First operand 530 states and 1690 transitions. Second operand 8 states. [2018-09-26 21:41:56,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:56,010 INFO L93 Difference]: Finished difference Result 1329 states and 3609 transitions. [2018-09-26 21:41:56,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 21:41:56,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 21:41:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:56,019 INFO L225 Difference]: With dead ends: 1329 [2018-09-26 21:41:56,019 INFO L226 Difference]: Without dead ends: 1323 [2018-09-26 21:41:56,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:56,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-09-26 21:41:56,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 626. [2018-09-26 21:41:56,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-09-26 21:41:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 2087 transitions. [2018-09-26 21:41:56,227 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 2087 transitions. Word has length 8 [2018-09-26 21:41:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:56,228 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 2087 transitions. [2018-09-26 21:41:56,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 2087 transitions. [2018-09-26 21:41:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:41:56,229 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:56,229 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:56,230 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:56,230 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:56,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656688, now seen corresponding path program 1 times [2018-09-26 21:41:56,230 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:56,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:56,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:56,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:56,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:56,342 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-26 21:41:56,343 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:56,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:41:56,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:41:56,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:41:56,344 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:56,344 INFO L87 Difference]: Start difference. First operand 626 states and 2087 transitions. Second operand 8 states. [2018-09-26 21:42:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:05,045 INFO L93 Difference]: Finished difference Result 1268 states and 3539 transitions. [2018-09-26 21:42:05,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 21:42:05,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 21:42:05,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:05,057 INFO L225 Difference]: With dead ends: 1268 [2018-09-26 21:42:05,057 INFO L226 Difference]: Without dead ends: 1262 [2018-09-26 21:42:05,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:05,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-09-26 21:42:05,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 618. [2018-09-26 21:42:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-09-26 21:42:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2056 transitions. [2018-09-26 21:42:05,252 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2056 transitions. Word has length 8 [2018-09-26 21:42:05,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:05,252 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 2056 transitions. [2018-09-26 21:42:05,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:42:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2056 transitions. [2018-09-26 21:42:05,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:42:05,253 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:05,253 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:05,254 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:05,254 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:05,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285639, now seen corresponding path program 1 times [2018-09-26 21:42:05,255 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:05,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:05,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:05,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:05,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:05,376 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-26 21:42:05,376 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:42:05,376 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:42:05,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:42:05,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:42:05,377 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:05,377 INFO L87 Difference]: Start difference. First operand 618 states and 2056 transitions. Second operand 8 states. [2018-09-26 21:42:14,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:14,481 INFO L93 Difference]: Finished difference Result 1367 states and 3876 transitions. [2018-09-26 21:42:14,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 21:42:14,482 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 21:42:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:14,490 INFO L225 Difference]: With dead ends: 1367 [2018-09-26 21:42:14,490 INFO L226 Difference]: Without dead ends: 1361 [2018-09-26 21:42:14,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:14,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-09-26 21:42:14,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 671. [2018-09-26 21:42:14,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-09-26 21:42:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2249 transitions. [2018-09-26 21:42:14,707 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2249 transitions. Word has length 8 [2018-09-26 21:42:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:14,708 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 2249 transitions. [2018-09-26 21:42:14,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:42:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2249 transitions. [2018-09-26 21:42:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:42:14,709 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:14,709 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:14,710 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:14,710 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:14,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285636, now seen corresponding path program 1 times [2018-09-26 21:42:14,710 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:14,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:14,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:14,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:14,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:14,801 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-26 21:42:14,802 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:42:14,802 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:42:14,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:42:14,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:42:14,803 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:14,803 INFO L87 Difference]: Start difference. First operand 671 states and 2249 transitions. Second operand 8 states. [2018-09-26 21:42:26,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:26,503 INFO L93 Difference]: Finished difference Result 1373 states and 3787 transitions. [2018-09-26 21:42:26,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:42:26,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 21:42:26,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:26,513 INFO L225 Difference]: With dead ends: 1373 [2018-09-26 21:42:26,513 INFO L226 Difference]: Without dead ends: 1367 [2018-09-26 21:42:26,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:26,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-09-26 21:42:26,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 698. [2018-09-26 21:42:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-09-26 21:42:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2344 transitions. [2018-09-26 21:42:26,861 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2344 transitions. Word has length 8 [2018-09-26 21:42:26,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:26,861 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 2344 transitions. [2018-09-26 21:42:26,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:42:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2344 transitions. [2018-09-26 21:42:26,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:42:26,863 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:26,863 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:26,864 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:26,864 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:26,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280348, now seen corresponding path program 1 times [2018-09-26 21:42:26,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:26,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:26,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:26,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:26,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:27,421 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-26 21:42:27,422 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:42:27,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:42:27,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:42:27,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:42:27,423 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:27,423 INFO L87 Difference]: Start difference. First operand 698 states and 2344 transitions. Second operand 7 states. [2018-09-26 21:42:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:36,307 INFO L93 Difference]: Finished difference Result 1526 states and 4298 transitions. [2018-09-26 21:42:36,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:42:36,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:42:36,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:36,315 INFO L225 Difference]: With dead ends: 1526 [2018-09-26 21:42:36,315 INFO L226 Difference]: Without dead ends: 1520 [2018-09-26 21:42:36,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:36,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-09-26 21:42:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 789. [2018-09-26 21:42:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-09-26 21:42:36,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2673 transitions. [2018-09-26 21:42:36,596 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2673 transitions. Word has length 8 [2018-09-26 21:42:36,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:36,597 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 2673 transitions. [2018-09-26 21:42:36,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:42:36,597 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2673 transitions. [2018-09-26 21:42:36,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:42:36,598 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:36,598 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:36,599 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:36,599 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:36,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280221, now seen corresponding path program 1 times [2018-09-26 21:42:36,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:36,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:36,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:36,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:36,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:36,683 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-26 21:42:36,684 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:42:36,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:42:36,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:42:36,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:42:36,685 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:36,685 INFO L87 Difference]: Start difference. First operand 789 states and 2673 transitions. Second operand 7 states. [2018-09-26 21:42:45,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:45,288 INFO L93 Difference]: Finished difference Result 1548 states and 4356 transitions. [2018-09-26 21:42:45,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:42:45,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:42:45,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:45,296 INFO L225 Difference]: With dead ends: 1548 [2018-09-26 21:42:45,296 INFO L226 Difference]: Without dead ends: 1542 [2018-09-26 21:42:45,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:45,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-09-26 21:42:45,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 821. [2018-09-26 21:42:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-09-26 21:42:45,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2801 transitions. [2018-09-26 21:42:45,578 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2801 transitions. Word has length 8 [2018-09-26 21:42:45,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:45,578 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 2801 transitions. [2018-09-26 21:42:45,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:42:45,578 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2801 transitions. [2018-09-26 21:42:45,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:42:45,579 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:45,580 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:45,580 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:45,580 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:45,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878937, now seen corresponding path program 1 times [2018-09-26 21:42:45,581 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:45,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:45,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:45,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:45,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:45,676 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-26 21:42:45,677 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:42:45,677 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:42:45,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:42:45,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:42:45,677 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:45,678 INFO L87 Difference]: Start difference. First operand 821 states and 2801 transitions. Second operand 7 states. [2018-09-26 21:42:54,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:54,567 INFO L93 Difference]: Finished difference Result 1575 states and 4539 transitions. [2018-09-26 21:42:54,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:42:54,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:42:54,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:54,575 INFO L225 Difference]: With dead ends: 1575 [2018-09-26 21:42:54,576 INFO L226 Difference]: Without dead ends: 1569 [2018-09-26 21:42:54,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:54,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-09-26 21:42:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 849. [2018-09-26 21:42:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-09-26 21:42:54,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2913 transitions. [2018-09-26 21:42:54,881 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2913 transitions. Word has length 8 [2018-09-26 21:42:54,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:54,881 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 2913 transitions. [2018-09-26 21:42:54,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:42:54,881 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2913 transitions. [2018-09-26 21:42:54,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:42:54,882 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:54,882 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:54,883 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:54,883 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:54,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878810, now seen corresponding path program 1 times [2018-09-26 21:42:54,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:54,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:54,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:54,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:54,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:54,980 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-26 21:42:54,980 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:42:54,980 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:42:54,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:42:54,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:42:54,981 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:54,981 INFO L87 Difference]: Start difference. First operand 849 states and 2913 transitions. Second operand 7 states. [2018-09-26 21:43:01,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:01,888 INFO L93 Difference]: Finished difference Result 1597 states and 4579 transitions. [2018-09-26 21:43:01,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:43:01,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:43:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:01,899 INFO L225 Difference]: With dead ends: 1597 [2018-09-26 21:43:01,899 INFO L226 Difference]: Without dead ends: 1591 [2018-09-26 21:43:01,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:01,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-09-26 21:43:02,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 873. [2018-09-26 21:43:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-09-26 21:43:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2993 transitions. [2018-09-26 21:43:02,225 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2993 transitions. Word has length 8 [2018-09-26 21:43:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:02,226 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 2993 transitions. [2018-09-26 21:43:02,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:43:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2993 transitions. [2018-09-26 21:43:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:43:02,227 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:02,227 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:02,228 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:02,228 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:02,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288024, now seen corresponding path program 1 times [2018-09-26 21:43:02,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:02,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:02,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:02,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:02,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:02,399 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-26 21:43:02,399 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:43:02,399 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:43:02,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:43:02,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:43:02,400 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:02,401 INFO L87 Difference]: Start difference. First operand 873 states and 2993 transitions. Second operand 7 states. [2018-09-26 21:43:08,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:08,620 INFO L93 Difference]: Finished difference Result 1726 states and 5211 transitions. [2018-09-26 21:43:08,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:43:08,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:43:08,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:08,631 INFO L225 Difference]: With dead ends: 1726 [2018-09-26 21:43:08,631 INFO L226 Difference]: Without dead ends: 1720 [2018-09-26 21:43:08,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:08,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2018-09-26 21:43:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1006. [2018-09-26 21:43:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-09-26 21:43:09,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3474 transitions. [2018-09-26 21:43:09,053 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3474 transitions. Word has length 8 [2018-09-26 21:43:09,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:09,053 INFO L480 AbstractCegarLoop]: Abstraction has 1006 states and 3474 transitions. [2018-09-26 21:43:09,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:43:09,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3474 transitions. [2018-09-26 21:43:09,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:43:09,055 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:09,055 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:09,056 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:09,056 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:09,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288027, now seen corresponding path program 1 times [2018-09-26 21:43:09,056 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:09,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:09,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:09,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:09,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:09,149 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-26 21:43:09,150 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:43:09,150 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:43:09,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:43:09,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:43:09,150 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:09,150 INFO L87 Difference]: Start difference. First operand 1006 states and 3474 transitions. Second operand 7 states. [2018-09-26 21:43:17,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:17,995 INFO L93 Difference]: Finished difference Result 1758 states and 5203 transitions. [2018-09-26 21:43:17,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:43:17,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:43:17,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:18,002 INFO L225 Difference]: With dead ends: 1758 [2018-09-26 21:43:18,003 INFO L226 Difference]: Without dead ends: 1752 [2018-09-26 21:43:18,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-09-26 21:43:18,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1011. [2018-09-26 21:43:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-09-26 21:43:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3493 transitions. [2018-09-26 21:43:18,458 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3493 transitions. Word has length 8 [2018-09-26 21:43:18,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:18,458 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 3493 transitions. [2018-09-26 21:43:18,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:43:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3493 transitions. [2018-09-26 21:43:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:43:18,459 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:18,459 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:18,460 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:18,460 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:18,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746872, now seen corresponding path program 1 times [2018-09-26 21:43:18,460 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:18,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:18,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:18,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:18,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:18,596 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-26 21:43:18,596 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:43:18,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:43:18,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:43:18,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:43:18,597 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:18,598 INFO L87 Difference]: Start difference. First operand 1011 states and 3493 transitions. Second operand 7 states. [2018-09-26 21:43:27,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:27,369 INFO L93 Difference]: Finished difference Result 1867 states and 5608 transitions. [2018-09-26 21:43:27,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:43:27,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:43:27,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:27,376 INFO L225 Difference]: With dead ends: 1867 [2018-09-26 21:43:27,377 INFO L226 Difference]: Without dead ends: 1861 [2018-09-26 21:43:27,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2018-09-26 21:43:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1119. [2018-09-26 21:43:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-09-26 21:43:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3931 transitions. [2018-09-26 21:43:27,954 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3931 transitions. Word has length 8 [2018-09-26 21:43:27,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:27,954 INFO L480 AbstractCegarLoop]: Abstraction has 1119 states and 3931 transitions. [2018-09-26 21:43:27,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:43:27,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3931 transitions. [2018-09-26 21:43:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:43:27,955 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:27,955 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:27,956 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:27,956 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:27,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746875, now seen corresponding path program 1 times [2018-09-26 21:43:27,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:27,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:27,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:27,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:27,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:28,071 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-26 21:43:28,072 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:43:28,072 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:43:28,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:43:28,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:43:28,073 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:28,073 INFO L87 Difference]: Start difference. First operand 1119 states and 3931 transitions. Second operand 7 states. [2018-09-26 21:43:38,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:38,109 INFO L93 Difference]: Finished difference Result 1968 states and 5829 transitions. [2018-09-26 21:43:38,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:43:38,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:43:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:38,118 INFO L225 Difference]: With dead ends: 1968 [2018-09-26 21:43:38,118 INFO L226 Difference]: Without dead ends: 1962 [2018-09-26 21:43:38,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:38,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-09-26 21:43:38,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1111. [2018-09-26 21:43:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-09-26 21:43:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3891 transitions. [2018-09-26 21:43:38,807 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3891 transitions. Word has length 8 [2018-09-26 21:43:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:38,807 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 3891 transitions. [2018-09-26 21:43:38,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:43:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3891 transitions. [2018-09-26 21:43:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:43:38,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:38,808 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:38,809 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:38,809 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:38,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1616407055, now seen corresponding path program 1 times [2018-09-26 21:43:38,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:38,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:38,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:38,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:38,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:38,906 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-26 21:43:38,906 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:43:38,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:43:38,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:43:38,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:43:38,907 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:38,907 INFO L87 Difference]: Start difference. First operand 1111 states and 3891 transitions. Second operand 7 states. [2018-09-26 21:43:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:47,116 INFO L93 Difference]: Finished difference Result 2001 states and 6001 transitions. [2018-09-26 21:43:47,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:43:47,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:43:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:47,122 INFO L225 Difference]: With dead ends: 2001 [2018-09-26 21:43:47,123 INFO L226 Difference]: Without dead ends: 1995 [2018-09-26 21:43:47,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:47,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-09-26 21:43:47,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1117. [2018-09-26 21:43:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-09-26 21:43:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 3909 transitions. [2018-09-26 21:43:47,794 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 3909 transitions. Word has length 8 [2018-09-26 21:43:47,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:47,794 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 3909 transitions. [2018-09-26 21:43:47,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:43:47,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 3909 transitions. [2018-09-26 21:43:47,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:43:47,795 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:47,795 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:47,796 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:47,796 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:47,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1616406928, now seen corresponding path program 1 times [2018-09-26 21:43:47,796 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:47,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:47,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:47,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:47,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:47,871 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-26 21:43:47,871 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:43:47,872 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:43:47,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:43:47,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:43:47,872 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:47,873 INFO L87 Difference]: Start difference. First operand 1117 states and 3909 transitions. Second operand 7 states. [2018-09-26 21:43:54,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:54,583 INFO L93 Difference]: Finished difference Result 1708 states and 5233 transitions. [2018-09-26 21:43:54,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:43:54,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:43:54,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:54,589 INFO L225 Difference]: With dead ends: 1708 [2018-09-26 21:43:54,589 INFO L226 Difference]: Without dead ends: 1702 [2018-09-26 21:43:54,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:54,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-09-26 21:43:55,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1210. [2018-09-26 21:43:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2018-09-26 21:43:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4307 transitions. [2018-09-26 21:43:55,348 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 4307 transitions. Word has length 8 [2018-09-26 21:43:55,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:55,348 INFO L480 AbstractCegarLoop]: Abstraction has 1210 states and 4307 transitions. [2018-09-26 21:43:55,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:43:55,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 4307 transitions. [2018-09-26 21:43:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:43:55,349 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:55,349 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:55,350 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:55,350 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:55,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256941, now seen corresponding path program 1 times [2018-09-26 21:43:55,350 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:55,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:55,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:55,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:55,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:55,418 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-26 21:43:55,419 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:43:55,419 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:43:55,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:43:55,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:43:55,419 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:55,419 INFO L87 Difference]: Start difference. First operand 1210 states and 4307 transitions. Second operand 7 states. [2018-09-26 21:44:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:04,931 INFO L93 Difference]: Finished difference Result 2402 states and 7321 transitions. [2018-09-26 21:44:04,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:44:04,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:44:04,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:04,936 INFO L225 Difference]: With dead ends: 2402 [2018-09-26 21:44:04,936 INFO L226 Difference]: Without dead ends: 2396 [2018-09-26 21:44:04,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:04,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-09-26 21:44:05,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1341. [2018-09-26 21:44:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-09-26 21:44:05,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4862 transitions. [2018-09-26 21:44:05,701 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4862 transitions. Word has length 8 [2018-09-26 21:44:05,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:05,701 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4862 transitions. [2018-09-26 21:44:05,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:44:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4862 transitions. [2018-09-26 21:44:05,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:44:05,703 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:05,703 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:44:05,703 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:05,703 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:05,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256944, now seen corresponding path program 1 times [2018-09-26 21:44:05,704 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:05,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:05,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:05,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:05,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:05,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:44:05,799 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:44:05,799 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:44:05,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:44:05,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:44:05,800 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:05,800 INFO L87 Difference]: Start difference. First operand 1341 states and 4862 transitions. Second operand 7 states. [2018-09-26 21:44:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:14,437 INFO L93 Difference]: Finished difference Result 2274 states and 6934 transitions. [2018-09-26 21:44:14,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:44:14,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 21:44:14,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:14,442 INFO L225 Difference]: With dead ends: 2274 [2018-09-26 21:44:14,442 INFO L226 Difference]: Without dead ends: 2268 [2018-09-26 21:44:14,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:14,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2018-09-26 21:44:15,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1337. [2018-09-26 21:44:15,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-09-26 21:44:15,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 4840 transitions. [2018-09-26 21:44:15,204 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 4840 transitions. Word has length 8 [2018-09-26 21:44:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:15,204 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 4840 transitions. [2018-09-26 21:44:15,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:44:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 4840 transitions. [2018-09-26 21:44:15,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:44:15,205 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:15,205 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-26 21:44:15,205 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:15,206 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:15,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1621267991, now seen corresponding path program 1 times [2018-09-26 21:44:15,206 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:15,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:15,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:15,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:15,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:15,275 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-26 21:44:15,275 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:44:15,275 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:44:15,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:44:15,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:44:15,276 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:15,276 INFO L87 Difference]: Start difference. First operand 1337 states and 4840 transitions. Second operand 4 states. [2018-09-26 21:44:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:16,719 INFO L93 Difference]: Finished difference Result 2170 states and 7637 transitions. [2018-09-26 21:44:16,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:44:16,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-26 21:44:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:16,722 INFO L225 Difference]: With dead ends: 2170 [2018-09-26 21:44:16,722 INFO L226 Difference]: Without dead ends: 1253 [2018-09-26 21:44:16,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:16,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-09-26 21:44:17,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1080. [2018-09-26 21:44:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-09-26 21:44:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3769 transitions. [2018-09-26 21:44:17,365 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3769 transitions. Word has length 8 [2018-09-26 21:44:17,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:17,365 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 3769 transitions. [2018-09-26 21:44:17,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:44:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3769 transitions. [2018-09-26 21:44:17,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:44:17,367 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:17,367 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:44:17,367 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:17,368 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:17,368 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283460, now seen corresponding path program 1 times [2018-09-26 21:44:17,368 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:17,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:17,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:17,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:17,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:17,595 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-26 21:44:17,595 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:44:17,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:44:17,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:44:17,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:44:17,596 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:17,596 INFO L87 Difference]: Start difference. First operand 1080 states and 3769 transitions. Second operand 8 states. [2018-09-26 21:44:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:30,236 INFO L93 Difference]: Finished difference Result 2095 states and 6316 transitions. [2018-09-26 21:44:30,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:44:30,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 21:44:30,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:30,241 INFO L225 Difference]: With dead ends: 2095 [2018-09-26 21:44:30,241 INFO L226 Difference]: Without dead ends: 2093 [2018-09-26 21:44:30,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-09-26 21:44:30,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1161. [2018-09-26 21:44:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2018-09-26 21:44:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 4123 transitions. [2018-09-26 21:44:30,977 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 4123 transitions. Word has length 8 [2018-09-26 21:44:30,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:30,978 INFO L480 AbstractCegarLoop]: Abstraction has 1161 states and 4123 transitions. [2018-09-26 21:44:30,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:44:30,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 4123 transitions. [2018-09-26 21:44:30,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:44:30,979 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:30,979 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:44:30,979 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr6ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:30,979 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:30,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283333, now seen corresponding path program 1 times [2018-09-26 21:44:30,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:30,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:30,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:30,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:30,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:31,762 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-26 21:44:31,763 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:44:31,763 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-26 21:44:31,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:44:31,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:44:31,763 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:31,764 INFO L87 Difference]: Start difference. First operand 1161 states and 4123 transitions. Second operand 8 states. Received shutdown request... [2018-09-26 21:44:37,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:44:37,689 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 21:44:37,696 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 21:44:37,696 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:44:37 BoogieIcfgContainer [2018-09-26 21:44:37,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:44:37,697 INFO L168 Benchmark]: Toolchain (without parser) took 254362.71 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 17.8 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 337.1 MB). Peak memory consumption was 354.9 MB. Max. memory is 7.1 GB. [2018-09-26 21:44:37,699 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:44:37,700 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:44:37,701 INFO L168 Benchmark]: Boogie Preprocessor took 71.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:44:37,701 INFO L168 Benchmark]: RCFGBuilder took 1106.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-26 21:44:37,702 INFO L168 Benchmark]: TraceAbstraction took 253130.50 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 17.8 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 294.8 MB). Peak memory consumption was 312.6 MB. Max. memory is 7.1 GB. [2018-09-26 21:44:37,707 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1106.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253130.50 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 17.8 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 294.8 MB). Peak memory consumption was 312.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 316]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 316). Cancelled while BasicCegarLoop was constructing difference of abstraction (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 337). Cancelled while BasicCegarLoop was constructing difference of abstraction (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 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 (1161states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (502 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 27 error locations. TIMEOUT Result, 253.0s OverallTime, 29 OverallIterations, 2 TraceHistogramMax, 238.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7914 SDtfs, 13664 SDslu, 14045 SDs, 0 SdLazy, 48867 SolverSat, 5142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 61.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 412 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1341occurred in iteration=25, 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: 9.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 15463 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 18590 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-44-37-722.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-44-37-722.csv Completed graceful shutdown