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_out_Reals.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:42:44,680 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:42:44,682 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:42:44,694 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:42:44,694 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:42:44,695 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:42:44,696 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:42:44,698 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:42:44,700 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:42:44,701 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:42:44,702 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:42:44,702 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:42:44,703 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:42:44,704 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:42:44,705 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:42:44,706 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:42:44,707 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:42:44,709 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:42:44,711 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:42:44,713 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:42:44,714 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:42:44,715 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:42:44,718 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:42:44,718 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:42:44,718 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:42:44,719 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:42:44,720 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:42:44,721 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:42:44,722 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:42:44,723 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:42:44,723 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:42:44,724 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:42:44,724 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:42:44,725 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:42:44,726 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:42:44,726 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:42:44,727 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-30 10:42:44,748 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:42:44,748 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:42:44,749 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:42:44,749 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:42:44,750 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:42:44,750 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:42:44,750 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:42:44,751 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:42:44,751 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:42:44,751 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:42:44,751 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:42:44,751 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:42:44,752 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:42:44,752 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:42:44,752 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:42:44,752 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:42:44,752 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:42:44,753 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:42:44,753 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:42:44,753 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:42:44,753 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:42:44,753 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:42:44,754 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:42:44,754 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:42:44,754 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:42:44,754 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:42:44,754 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:42:44,755 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:42:44,755 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:42:44,755 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:42:44,755 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 10:42:44,802 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:42:44,819 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:42:44,827 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:42:44,829 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:42:44,830 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:42:44,831 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl [2018-09-30 10:42:44,831 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-09-30 10:42:44,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:42:44,934 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:42:44,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:42:44,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:42:44,935 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:42:44,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:44" (1/1) ... [2018-09-30 10:42:44,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:44" (1/1) ... [2018-09-30 10:42:44,992 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 10:42:44,994 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 10:42:44,995 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 10:42:44,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:42:44,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:42:44,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:42:44,999 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:42:45,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:44" (1/1) ... [2018-09-30 10:42:45,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:44" (1/1) ... [2018-09-30 10:42:45,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:44" (1/1) ... [2018-09-30 10:42:45,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:44" (1/1) ... [2018-09-30 10:42:45,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:44" (1/1) ... [2018-09-30 10:42:45,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:44" (1/1) ... [2018-09-30 10:42:45,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:44" (1/1) ... [2018-09-30 10:42:45,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:42:45,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:42:45,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:42:45,056 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:42:45,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:44" (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-30 10:42:45,139 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 10:42:45,140 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 10:42:45,140 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 10:42:46,020 INFO L345 CfgBuilder]: Using library mode [2018-09-30 10:42:46,021 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:42:46 BoogieIcfgContainer [2018-09-30 10:42:46,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:42:46,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:42:46,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:42:46,027 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:42:46,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:42:44" (1/2) ... [2018-09-30 10:42:46,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec80d6b and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:42:46, skipping insertion in model container [2018-09-30 10:42:46,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:42:46" (2/2) ... [2018-09-30 10:42:46,034 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-09-30 10:42:46,045 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:42:46,059 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-30 10:42:46,118 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:42:46,119 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:42:46,119 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:42:46,119 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:42:46,119 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:42:46,119 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:42:46,119 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:42:46,119 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:42:46,120 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:42:46,144 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-30 10:42:46,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 10:42:46,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:46,152 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:46,154 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:46,160 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:46,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-30 10:42:46,162 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:46,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:46,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:46,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:46,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:46,424 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-30 10:42:46,427 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:46,427 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:42:46,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:42:46,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:42:46,449 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:46,451 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-30 10:42:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:50,168 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-30 10:42:50,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:42:50,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 10:42:50,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:50,195 INFO L225 Difference]: With dead ends: 163 [2018-09-30 10:42:50,196 INFO L226 Difference]: Without dead ends: 158 [2018-09-30 10:42:50,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-30 10:42:50,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-30 10:42:50,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 10:42:50,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-30 10:42:50,270 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-30 10:42:50,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:50,271 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-30 10:42:50,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:42:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-30 10:42:50,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 10:42:50,272 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:50,272 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:50,273 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:50,274 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:50,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-30 10:42:50,274 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:50,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:50,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:50,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:50,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:50,362 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-30 10:42:50,362 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:50,363 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:42:50,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:42:50,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:42:50,365 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:50,365 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-30 10:42:52,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:52,751 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-30 10:42:52,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:42:52,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 10:42:52,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:52,756 INFO L225 Difference]: With dead ends: 188 [2018-09-30 10:42:52,756 INFO L226 Difference]: Without dead ends: 183 [2018-09-30 10:42:52,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:52,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-30 10:42:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-30 10:42:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-30 10:42:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-30 10:42:52,780 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-30 10:42:52,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:52,780 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-30 10:42:52,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:42:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-30 10:42:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:42:52,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:52,782 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:52,783 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:52,783 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:52,783 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-30 10:42:52,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:52,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:52,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:52,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:52,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:52,879 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-30 10:42:52,879 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:52,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:42:52,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:42:52,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:42:52,881 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:52,881 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-30 10:42:56,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:42:56,194 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-09-30 10:42:56,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:42:56,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 10:42:56,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:42:56,199 INFO L225 Difference]: With dead ends: 283 [2018-09-30 10:42:56,199 INFO L226 Difference]: Without dead ends: 278 [2018-09-30 10:42:56,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:42:56,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-30 10:42:56,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-09-30 10:42:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-30 10:42:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-09-30 10:42:56,231 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-09-30 10:42:56,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:42:56,231 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-09-30 10:42:56,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:42:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-09-30 10:42:56,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:42:56,232 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:42:56,233 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:42:56,233 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:42:56,234 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:42:56,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-30 10:42:56,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:42:56,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:42:56,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:56,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:42:56,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:42:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:42:56,339 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-30 10:42:56,340 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:42:56,340 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:42:56,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:42:56,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:42:56,341 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:42:56,341 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-09-30 10:43:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:00,559 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-09-30 10:43:00,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:43:00,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 10:43:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:00,565 INFO L225 Difference]: With dead ends: 387 [2018-09-30 10:43:00,565 INFO L226 Difference]: Without dead ends: 375 [2018-09-30 10:43:00,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-30 10:43:00,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-09-30 10:43:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-30 10:43:00,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-30 10:43:00,609 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-30 10:43:00,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:00,610 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-30 10:43:00,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:43:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-30 10:43:00,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:43:00,612 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:00,612 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:00,613 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:00,613 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:00,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-30 10:43:00,613 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:00,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:00,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:00,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:00,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:00,730 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-30 10:43:00,730 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:00,730 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:00,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:43:00,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:43:00,731 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:00,731 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-09-30 10:43:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:07,224 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-09-30 10:43:07,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:43:07,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:43:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:07,231 INFO L225 Difference]: With dead ends: 725 [2018-09-30 10:43:07,231 INFO L226 Difference]: Without dead ends: 717 [2018-09-30 10:43:07,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:07,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-09-30 10:43:07,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-09-30 10:43:07,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-30 10:43:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-09-30 10:43:07,298 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-09-30 10:43:07,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:07,298 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-09-30 10:43:07,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:43:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-09-30 10:43:07,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:43:07,301 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:07,301 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:07,301 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:07,302 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:07,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-30 10:43:07,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:07,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:07,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:07,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:07,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:07,436 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-30 10:43:07,437 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:07,437 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:07,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:43:07,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:43:07,438 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:07,438 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-09-30 10:43:23,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:23,851 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-09-30 10:43:23,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:43:23,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:43:23,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:23,862 INFO L225 Difference]: With dead ends: 1008 [2018-09-30 10:43:23,862 INFO L226 Difference]: Without dead ends: 1000 [2018-09-30 10:43:23,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:23,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-09-30 10:43:23,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-09-30 10:43:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-09-30 10:43:23,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-09-30 10:43:23,948 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-09-30 10:43:23,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:23,949 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-09-30 10:43:23,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:43:23,949 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-09-30 10:43:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:43:23,951 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:23,951 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:23,952 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:23,952 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:23,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-30 10:43:23,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:23,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:23,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:24,063 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-30 10:43:24,063 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:24,064 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:24,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:43:24,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:43:24,064 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:24,065 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-09-30 10:43:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:32,578 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-09-30 10:43:32,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 10:43:32,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:43:32,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:32,585 INFO L225 Difference]: With dead ends: 924 [2018-09-30 10:43:32,585 INFO L226 Difference]: Without dead ends: 916 [2018-09-30 10:43:32,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-09-30 10:43:32,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-09-30 10:43:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-09-30 10:43:32,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-09-30 10:43:32,679 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-09-30 10:43:32,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:32,679 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-09-30 10:43:32,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:43:32,680 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-09-30 10:43:32,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:43:32,681 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:32,681 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:32,682 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:32,682 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:32,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-30 10:43:32,682 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:32,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:32,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:32,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:32,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:33,164 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-30 10:43:33,165 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:33,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:33,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:43:33,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:43:33,166 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:33,166 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-09-30 10:43:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:39,843 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-09-30 10:43:39,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:43:39,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:43:39,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:39,850 INFO L225 Difference]: With dead ends: 791 [2018-09-30 10:43:39,850 INFO L226 Difference]: Without dead ends: 783 [2018-09-30 10:43:39,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:39,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-09-30 10:43:39,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-09-30 10:43:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-09-30 10:43:39,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-09-30 10:43:39,935 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-09-30 10:43:39,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:39,935 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-09-30 10:43:39,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:43:39,936 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-09-30 10:43:39,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:43:39,937 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:39,937 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:39,938 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:39,938 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:39,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-09-30 10:43:39,938 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:39,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:39,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:39,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:39,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:40,034 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-30 10:43:40,034 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:40,034 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:40,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:43:40,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:43:40,036 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:40,036 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-09-30 10:43:47,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:47,175 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-09-30 10:43:47,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 10:43:47,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:43:47,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:47,183 INFO L225 Difference]: With dead ends: 1040 [2018-09-30 10:43:47,183 INFO L226 Difference]: Without dead ends: 1032 [2018-09-30 10:43:47,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-09-30 10:43:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-09-30 10:43:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-09-30 10:43:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-09-30 10:43:47,313 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-09-30 10:43:47,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:47,313 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-09-30 10:43:47,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:43:47,314 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-09-30 10:43:47,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:43:47,314 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:47,315 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:47,315 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:47,316 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:47,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-09-30 10:43:47,316 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:47,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:47,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:47,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:47,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:47,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:43:47,456 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:47,456 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:47,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:43:47,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:43:47,457 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:47,458 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-09-30 10:43:55,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:43:55,741 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-09-30 10:43:55,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 10:43:55,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:43:55,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:43:55,748 INFO L225 Difference]: With dead ends: 1166 [2018-09-30 10:43:55,748 INFO L226 Difference]: Without dead ends: 1158 [2018-09-30 10:43:55,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:43:55,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-09-30 10:43:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-09-30 10:43:55,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-09-30 10:43:55,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-09-30 10:43:55,929 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-09-30 10:43:55,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:43:55,930 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-09-30 10:43:55,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:43:55,930 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-09-30 10:43:55,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:43:55,931 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:43:55,931 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:43:55,931 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:43:55,932 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:43:55,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-09-30 10:43:55,932 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:43:55,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:43:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:55,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:43:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:43:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:43:56,231 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-30 10:43:56,231 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:43:56,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:43:56,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:43:56,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:43:56,232 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:43:56,232 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-09-30 10:44:04,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:04,100 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-09-30 10:44:04,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 10:44:04,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:44:04,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:04,107 INFO L225 Difference]: With dead ends: 1127 [2018-09-30 10:44:04,107 INFO L226 Difference]: Without dead ends: 1119 [2018-09-30 10:44:04,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:04,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-09-30 10:44:04,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-09-30 10:44:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-09-30 10:44:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-09-30 10:44:04,278 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-09-30 10:44:04,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:04,279 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-09-30 10:44:04,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:44:04,279 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-09-30 10:44:04,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:44:04,280 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:04,280 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:04,280 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:04,281 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:04,281 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-09-30 10:44:04,281 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:04,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:04,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:04,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:04,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:04,436 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-30 10:44:04,436 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:04,437 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:44:04,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:44:04,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:44:04,437 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:04,438 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-09-30 10:44:11,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:11,595 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-09-30 10:44:11,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 10:44:11,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:44:11,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:11,602 INFO L225 Difference]: With dead ends: 975 [2018-09-30 10:44:11,602 INFO L226 Difference]: Without dead ends: 967 [2018-09-30 10:44:11,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:11,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-09-30 10:44:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-09-30 10:44:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-09-30 10:44:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-09-30 10:44:11,781 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-09-30 10:44:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:11,783 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-09-30 10:44:11,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:44:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-09-30 10:44:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:44:11,784 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:11,784 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:11,786 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:11,786 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:11,786 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-09-30 10:44:11,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:11,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:11,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:11,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:11,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:12,159 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-30 10:44:12,159 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:12,159 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:44:12,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:44:12,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:44:12,160 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:12,161 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-09-30 10:44:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:20,002 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-09-30 10:44:20,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 10:44:20,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:44:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:20,007 INFO L225 Difference]: With dead ends: 1011 [2018-09-30 10:44:20,007 INFO L226 Difference]: Without dead ends: 1003 [2018-09-30 10:44:20,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:20,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-09-30 10:44:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-09-30 10:44:20,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-09-30 10:44:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-09-30 10:44:20,190 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-09-30 10:44:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:20,190 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-09-30 10:44:20,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:44:20,191 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-09-30 10:44:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:44:20,191 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:20,191 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:20,192 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:20,192 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:20,192 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-09-30 10:44:20,192 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:20,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:20,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:20,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:20,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:20,284 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-30 10:44:20,285 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:20,285 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:44:20,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:44:20,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:44:20,286 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:20,286 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-09-30 10:44:26,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:26,624 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-09-30 10:44:26,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:44:26,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 10:44:26,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:26,628 INFO L225 Difference]: With dead ends: 859 [2018-09-30 10:44:26,628 INFO L226 Difference]: Without dead ends: 851 [2018-09-30 10:44:26,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:26,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-09-30 10:44:26,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-09-30 10:44:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-30 10:44:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-30 10:44:26,824 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-30 10:44:26,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:26,824 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-30 10:44:26,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:44:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-30 10:44:26,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:44:26,825 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:26,825 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:26,825 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:26,825 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:26,826 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-30 10:44:26,826 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:26,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:26,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:26,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:26,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:26,901 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:26,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:44:26,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:44:26,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:44:26,902 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:26,902 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-30 10:44:33,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:33,059 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-09-30 10:44:33,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:44:33,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:44:33,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:33,064 INFO L225 Difference]: With dead ends: 962 [2018-09-30 10:44:33,064 INFO L226 Difference]: Without dead ends: 954 [2018-09-30 10:44:33,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:33,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-30 10:44:33,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-09-30 10:44:33,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-09-30 10:44:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-09-30 10:44:33,307 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-09-30 10:44:33,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:33,307 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-09-30 10:44:33,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:44:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-09-30 10:44:33,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:44:33,308 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:33,308 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:33,308 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:33,308 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:33,309 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-09-30 10:44:33,309 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:33,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:33,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:33,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:33,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:33,387 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-30 10:44:33,388 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:33,388 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:44:33,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:44:33,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:44:33,389 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:33,389 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-09-30 10:44:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:41,005 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-09-30 10:44:41,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 10:44:41,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:44:41,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:41,009 INFO L225 Difference]: With dead ends: 1064 [2018-09-30 10:44:41,009 INFO L226 Difference]: Without dead ends: 1056 [2018-09-30 10:44:41,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:41,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-09-30 10:44:41,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-09-30 10:44:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-09-30 10:44:41,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-09-30 10:44:41,260 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-09-30 10:44:41,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:41,260 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-09-30 10:44:41,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:44:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-09-30 10:44:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:44:41,261 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:41,261 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:41,262 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:41,262 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:41,262 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-30 10:44:41,262 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:41,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:41,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:41,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:41,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:44:41,374 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:41,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:44:41,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:44:41,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:44:41,375 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:41,375 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-09-30 10:44:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:50,688 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-09-30 10:44:50,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 10:44:50,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:44:50,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:50,694 INFO L225 Difference]: With dead ends: 1241 [2018-09-30 10:44:50,695 INFO L226 Difference]: Without dead ends: 1233 [2018-09-30 10:44:50,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:50,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-09-30 10:44:51,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-09-30 10:44:51,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-30 10:44:51,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-09-30 10:44:51,023 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-09-30 10:44:51,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:51,024 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-09-30 10:44:51,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:44:51,024 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-09-30 10:44:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:44:51,025 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:51,025 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:51,026 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:51,026 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:51,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-09-30 10:44:51,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:51,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:51,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:51,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:51,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:51,103 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-30 10:44:51,103 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:51,104 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:44:51,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:44:51,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:44:51,104 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:51,105 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-09-30 10:44:57,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:44:57,151 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-09-30 10:44:57,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:44:57,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:44:57,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:44:57,157 INFO L225 Difference]: With dead ends: 1139 [2018-09-30 10:44:57,157 INFO L226 Difference]: Without dead ends: 1131 [2018-09-30 10:44:57,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:44:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-09-30 10:44:57,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-09-30 10:44:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-09-30 10:44:57,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-09-30 10:44:57,465 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-09-30 10:44:57,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:44:57,466 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-09-30 10:44:57,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:44:57,466 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-09-30 10:44:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:44:57,466 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:44:57,467 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:44:57,467 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:44:57,467 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:44:57,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-09-30 10:44:57,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:44:57,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:44:57,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:57,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:44:57,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:44:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:44:57,563 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-30 10:44:57,564 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:44:57,564 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:44:57,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:44:57,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:44:57,565 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:44:57,565 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-09-30 10:45:05,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:05,392 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-09-30 10:45:05,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:45:05,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:45:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:05,398 INFO L225 Difference]: With dead ends: 1325 [2018-09-30 10:45:05,399 INFO L226 Difference]: Without dead ends: 1317 [2018-09-30 10:45:05,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:05,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-09-30 10:45:05,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-09-30 10:45:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-09-30 10:45:05,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-09-30 10:45:05,752 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-09-30 10:45:05,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:05,752 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-09-30 10:45:05,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:45:05,752 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-09-30 10:45:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:45:05,753 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:05,753 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:05,753 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:05,753 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:05,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-30 10:45:05,754 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:05,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:05,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:05,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:05,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:06,014 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-30 10:45:06,014 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:06,016 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:45:06,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:45:06,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:45:06,016 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:06,017 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-09-30 10:45:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:14,546 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-09-30 10:45:14,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:45:14,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:45:14,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:14,552 INFO L225 Difference]: With dead ends: 1334 [2018-09-30 10:45:14,552 INFO L226 Difference]: Without dead ends: 1326 [2018-09-30 10:45:14,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:14,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-09-30 10:45:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-09-30 10:45:14,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-09-30 10:45:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-09-30 10:45:14,917 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-09-30 10:45:14,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:14,917 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-09-30 10:45:14,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:45:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-09-30 10:45:14,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:45:14,918 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:14,918 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:14,918 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:14,919 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:14,919 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-09-30 10:45:14,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:14,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:14,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:14,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:14,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:14,999 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-30 10:45:14,999 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:14,999 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:45:15,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:45:15,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:45:15,000 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:15,001 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-09-30 10:45:19,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:19,913 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-09-30 10:45:19,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:45:19,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:45:19,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:19,918 INFO L225 Difference]: With dead ends: 919 [2018-09-30 10:45:19,918 INFO L226 Difference]: Without dead ends: 911 [2018-09-30 10:45:19,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:19,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-09-30 10:45:20,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-09-30 10:45:20,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-30 10:45:20,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-09-30 10:45:20,301 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-09-30 10:45:20,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:20,301 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-09-30 10:45:20,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:45:20,301 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-09-30 10:45:20,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:45:20,302 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:20,302 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:20,302 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:20,302 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:20,302 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-09-30 10:45:20,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:20,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:20,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:20,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:20,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:20,387 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-30 10:45:20,388 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:20,388 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:45:20,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:45:20,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:45:20,389 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:20,389 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-09-30 10:45:27,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:27,211 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-09-30 10:45:27,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:45:27,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:45:27,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:27,219 INFO L225 Difference]: With dead ends: 1095 [2018-09-30 10:45:27,220 INFO L226 Difference]: Without dead ends: 1087 [2018-09-30 10:45:27,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:27,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-09-30 10:45:27,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-09-30 10:45:27,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-09-30 10:45:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-09-30 10:45:27,603 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-09-30 10:45:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:27,603 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-09-30 10:45:27,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:45:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-09-30 10:45:27,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:45:27,604 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:27,604 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:27,605 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:27,605 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:27,605 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-09-30 10:45:27,605 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:27,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:27,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:27,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:27,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:27,675 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-30 10:45:27,675 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:27,676 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:45:27,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:45:27,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:45:27,676 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:27,677 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-09-30 10:45:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:36,846 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-09-30 10:45:36,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:45:36,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:45:36,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:36,849 INFO L225 Difference]: With dead ends: 1304 [2018-09-30 10:45:36,850 INFO L226 Difference]: Without dead ends: 1296 [2018-09-30 10:45:36,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:36,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-30 10:45:37,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-09-30 10:45:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-09-30 10:45:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-09-30 10:45:37,219 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-09-30 10:45:37,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:37,220 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-09-30 10:45:37,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:45:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-09-30 10:45:37,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:45:37,221 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:37,221 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:37,221 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:37,222 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:37,222 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-30 10:45:37,222 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:37,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:37,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:37,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:37,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:37,304 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-30 10:45:37,305 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:37,305 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:45:37,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:45:37,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:45:37,306 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:37,306 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-09-30 10:45:45,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:45,091 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-09-30 10:45:45,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 10:45:45,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:45:45,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:45,094 INFO L225 Difference]: With dead ends: 1192 [2018-09-30 10:45:45,095 INFO L226 Difference]: Without dead ends: 1184 [2018-09-30 10:45:45,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:45,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-09-30 10:45:45,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-09-30 10:45:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-30 10:45:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-30 10:45:45,616 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-30 10:45:45,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:45,616 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-30 10:45:45,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:45:45,616 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-30 10:45:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:45:45,617 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:45,617 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:45,618 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:45,618 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:45,618 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-09-30 10:45:45,618 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:45,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:45,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:45,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:45,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:45,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:45,662 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:45,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:45:45,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:45:45,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:45:45,663 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:45,663 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-30 10:45:46,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:46,763 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-09-30 10:45:46,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:45:46,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 10:45:46,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:46,765 INFO L225 Difference]: With dead ends: 1139 [2018-09-30 10:45:46,765 INFO L226 Difference]: Without dead ends: 625 [2018-09-30 10:45:46,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:46,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-09-30 10:45:47,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-09-30 10:45:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-30 10:45:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-09-30 10:45:47,287 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-09-30 10:45:47,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:47,287 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-09-30 10:45:47,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:45:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-09-30 10:45:47,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:45:47,288 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:47,288 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:47,289 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:47,289 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:47,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-09-30 10:45:47,289 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:47,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:47,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:47,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:47,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:47,381 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:45:47,381 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:45:47,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:47,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:45:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:45:48,641 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:45:48,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-30 10:45:48,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:45:48,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:45:48,642 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:48,642 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 16 states. [2018-09-30 10:45:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:45:58,621 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-09-30 10:45:58,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:45:58,621 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-09-30 10:45:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:45:58,622 INFO L225 Difference]: With dead ends: 794 [2018-09-30 10:45:58,623 INFO L226 Difference]: Without dead ends: 789 [2018-09-30 10:45:58,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:45:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-30 10:45:59,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-09-30 10:45:59,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-09-30 10:45:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-09-30 10:45:59,352 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-09-30 10:45:59,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:45:59,352 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-09-30 10:45:59,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:45:59,352 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-09-30 10:45:59,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:45:59,353 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:45:59,353 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:45:59,353 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:45:59,354 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:45:59,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-09-30 10:45:59,354 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:45:59,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:45:59,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:59,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:45:59,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:45:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:45:59,410 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-30 10:45:59,410 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:45:59,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:45:59,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:45:59,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:45:59,411 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:45:59,411 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-09-30 10:46:01,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:01,693 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-09-30 10:46:01,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:46:01,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 10:46:01,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:01,695 INFO L225 Difference]: With dead ends: 1317 [2018-09-30 10:46:01,695 INFO L226 Difference]: Without dead ends: 729 [2018-09-30 10:46:01,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:01,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-09-30 10:46:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-09-30 10:46:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-30 10:46:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-30 10:46:02,318 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-30 10:46:02,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:02,318 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-30 10:46:02,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:46:02,318 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-30 10:46:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:46:02,319 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:02,319 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:02,320 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:02,320 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:02,320 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-09-30 10:46:02,320 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:02,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:02,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:02,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:02,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:02,938 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-30 10:46:02,938 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:46:02,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:46:02,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:46:02,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:46:02,939 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:02,939 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-09-30 10:46:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:10,561 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-09-30 10:46:10,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 10:46:10,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:46:10,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:10,564 INFO L225 Difference]: With dead ends: 1435 [2018-09-30 10:46:10,564 INFO L226 Difference]: Without dead ends: 1427 [2018-09-30 10:46:10,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:10,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-09-30 10:46:11,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-09-30 10:46:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-09-30 10:46:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-09-30 10:46:11,501 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-09-30 10:46:11,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:11,501 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-09-30 10:46:11,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:46:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-09-30 10:46:11,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:46:11,502 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:11,502 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:11,502 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:11,503 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:11,503 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-09-30 10:46:11,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:11,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:11,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:11,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:11,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:11,780 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-30 10:46:11,781 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:46:11,781 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:46:11,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:46:11,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:46:11,781 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:11,782 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-09-30 10:46:19,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:19,899 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-09-30 10:46:19,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:46:19,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:46:19,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:19,903 INFO L225 Difference]: With dead ends: 1599 [2018-09-30 10:46:19,903 INFO L226 Difference]: Without dead ends: 1591 [2018-09-30 10:46:19,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:19,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-09-30 10:46:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-09-30 10:46:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-09-30 10:46:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-09-30 10:46:20,751 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-09-30 10:46:20,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:20,752 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-09-30 10:46:20,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:46:20,752 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-09-30 10:46:20,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:46:20,753 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:20,753 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:20,753 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:20,753 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:20,753 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-09-30 10:46:20,753 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:20,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:20,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:20,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:20,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:20,862 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-30 10:46:20,863 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:46:20,863 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:46:20,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:46:20,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:46:20,864 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:20,864 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-09-30 10:46:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:27,749 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-09-30 10:46:27,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:46:27,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:46:27,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:27,758 INFO L225 Difference]: With dead ends: 1411 [2018-09-30 10:46:27,759 INFO L226 Difference]: Without dead ends: 1403 [2018-09-30 10:46:27,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-09-30 10:46:28,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-09-30 10:46:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-09-30 10:46:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-09-30 10:46:28,617 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-09-30 10:46:28,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:28,617 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-09-30 10:46:28,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:46:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-09-30 10:46:28,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:46:28,618 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:28,618 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:28,618 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:28,618 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:28,619 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-09-30 10:46:28,619 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:28,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:28,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:28,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:28,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:28,787 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-30 10:46:28,787 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:46:28,787 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:46:28,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:46:28,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:46:28,788 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:28,788 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-09-30 10:46:36,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:36,329 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-09-30 10:46:36,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:46:36,330 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:46:36,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:36,333 INFO L225 Difference]: With dead ends: 1490 [2018-09-30 10:46:36,334 INFO L226 Difference]: Without dead ends: 1482 [2018-09-30 10:46:36,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:36,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-09-30 10:46:37,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-09-30 10:46:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-09-30 10:46:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-09-30 10:46:37,492 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-09-30 10:46:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:37,492 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-09-30 10:46:37,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:46:37,492 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-09-30 10:46:37,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:46:37,492 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:37,493 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:37,493 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:37,493 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:37,493 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-09-30 10:46:37,494 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:37,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:37,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:37,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:37,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:37,669 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-30 10:46:37,669 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:46:37,669 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:46:37,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:46:37,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:46:37,670 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:37,670 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-09-30 10:46:44,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:46:44,991 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-09-30 10:46:44,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:46:44,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 10:46:44,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:46:44,993 INFO L225 Difference]: With dead ends: 1427 [2018-09-30 10:46:44,993 INFO L226 Difference]: Without dead ends: 1419 [2018-09-30 10:46:44,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:46:44,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-09-30 10:46:45,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-09-30 10:46:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-09-30 10:46:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-09-30 10:46:45,943 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-09-30 10:46:45,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:46:45,943 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-09-30 10:46:45,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:46:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-09-30 10:46:45,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:46:45,944 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:46:45,945 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:46:45,945 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:46:45,945 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:46:45,945 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-09-30 10:46:45,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:46:45,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:46:45,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:45,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:46:45,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:46:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:46:46,017 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-30 10:46:46,017 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:46:46,017 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:46:46,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:46:46,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:46:46,018 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:46:46,019 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. Received shutdown request... [2018-09-30 10:46:47,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:46:47,813 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 10:46:47,819 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 10:46:47,820 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:46:47 BoogieIcfgContainer [2018-09-30 10:46:47,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:46:47,821 INFO L168 Benchmark]: Toolchain (without parser) took 242890.36 ms. Allocated memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: -176.2 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 179.6 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2018-09-30 10:46:47,823 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:46:47,824 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:46:47,825 INFO L168 Benchmark]: Boogie Preprocessor took 56.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:46:47,825 INFO L168 Benchmark]: RCFGBuilder took 965.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:46:47,826 INFO L168 Benchmark]: TraceAbstraction took 241797.01 ms. Allocated memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: -176.2 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 147.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:46:47,831 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.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 965.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241797.01 ms. Allocated memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: -176.2 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 147.9 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was constructing difference of abstraction (927states) and FLOYD_HOARE automaton (currently 8 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (137 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was constructing difference of abstraction (927states) and FLOYD_HOARE automaton (currently 8 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (137 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (927states) and FLOYD_HOARE automaton (currently 8 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (137 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (927states) and FLOYD_HOARE automaton (currently 8 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (137 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was constructing difference of abstraction (927states) and FLOYD_HOARE automaton (currently 8 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (137 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (927states) and FLOYD_HOARE automaton (currently 8 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (137 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was constructing difference of abstraction (927states) and FLOYD_HOARE automaton (currently 8 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (137 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (927states) and FLOYD_HOARE automaton (currently 8 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (137 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (927states) and FLOYD_HOARE automaton (currently 8 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (137 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (927states) and FLOYD_HOARE automaton (currently 8 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (137 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (927states) and FLOYD_HOARE automaton (currently 8 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (137 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was constructing difference of abstraction (927states) and FLOYD_HOARE automaton (currently 8 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (137 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (927states) and FLOYD_HOARE automaton (currently 8 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (137 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was constructing difference of abstraction (927states) and FLOYD_HOARE automaton (currently 8 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (137 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 241.7s OverallTime, 33 OverallIterations, 2 TraceHistogramMax, 223.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8509 SDtfs, 23501 SDslu, 25962 SDs, 0 SdLazy, 48090 SolverSat, 4891 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 703 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 678 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=943occurred in iteration=31, 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: 11.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 15167 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 386 ConstructedInterpolants, 0 QuantifiedInterpolants, 14547 SizeOfPredicates, 5 NumberOfNonLiveVariables, 35 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 34 InterpolantComputations, 32 PerfectInterpolantSequences, 7/11 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_out_Reals.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-46-47-843.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out_Reals.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-46-47-843.csv Completed graceful shutdown